./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/build_fullname.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-dietlibc/build_fullname.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash d5a9d2464f90cb604e81a75f4f55e926d182d9fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:31:45,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:31:45,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:31:45,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:31:45,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:31:45,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:31:45,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:31:45,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:31:45,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:31:45,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:31:45,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:31:45,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:31:45,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:31:45,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:31:45,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:31:45,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:31:45,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:31:45,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:31:45,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:31:45,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:31:45,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:31:45,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:31:45,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:31:45,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:31:45,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:31:45,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:31:45,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:31:45,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:31:45,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:31:45,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:31:45,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:31:45,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:31:45,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:31:45,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:31:45,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:31:45,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:31:45,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:31:45,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:31:45,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:31:45,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:31:45,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:31:45,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:31:45,844 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:31:45,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:31:45,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:31:45,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:31:45,851 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:31:45,851 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:31:45,851 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:31:45,852 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:31:45,852 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:31:45,852 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:31:45,852 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:31:45,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:31:45,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:31:45,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:31:45,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:31:45,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:31:45,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:31:45,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:31:45,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:31:45,855 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:31:45,855 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:31:45,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:31:45,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:31:45,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:31:45,856 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:31:45,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:31:45,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:31:45,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:31:45,857 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:31:45,858 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:31:45,858 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2020-07-29 01:31:46,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:31:46,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:31:46,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:31:46,166 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:31:46,168 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:31:46,170 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/build_fullname.i [2020-07-29 01:31:46,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad86b3a/9362e14fcb2b40208d95865163b61228/FLAG43237b73b [2020-07-29 01:31:46,758 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:31:46,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/build_fullname.i [2020-07-29 01:31:46,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad86b3a/9362e14fcb2b40208d95865163b61228/FLAG43237b73b [2020-07-29 01:31:47,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bad86b3a/9362e14fcb2b40208d95865163b61228 [2020-07-29 01:31:47,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:31:47,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:31:47,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:47,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:31:47,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:31:47,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6f06a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47, skipping insertion in model container [2020-07-29 01:31:47,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:31:47,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:31:47,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:47,510 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:31:47,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:47,639 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:31:47,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47 WrapperNode [2020-07-29 01:31:47,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:47,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:47,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:31:47,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:31:47,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:47,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:31:47,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:31:47,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:31:47,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (1/1) ... [2020-07-29 01:31:47,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:31:47,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:31:47,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:31:47,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:31:47,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (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 01:31:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:31:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:31:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:31:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:31:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:31:47,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:31:48,348 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:31:48,349 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-29 01:31:48,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:48 BoogieIcfgContainer [2020-07-29 01:31:48,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:31:48,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:31:48,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:31:48,357 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:31:48,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:48,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:31:47" (1/3) ... [2020-07-29 01:31:48,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@86c8799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:48, skipping insertion in model container [2020-07-29 01:31:48,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:48,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:47" (2/3) ... [2020-07-29 01:31:48,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@86c8799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:48, skipping insertion in model container [2020-07-29 01:31:48,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:48,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:48" (3/3) ... [2020-07-29 01:31:48,362 INFO L371 chiAutomizerObserver]: Analyzing ICFG build_fullname.i [2020-07-29 01:31:48,403 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:31:48,403 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:31:48,403 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:31:48,404 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:31:48,405 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:31:48,405 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:31:48,405 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:31:48,405 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:31:48,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-29 01:31:48,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 01:31:48,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,447 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:31:48,447 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:31:48,447 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:31:48,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-29 01:31:48,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 01:31:48,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:31:48,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:31:48,461 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2020-07-29 01:31:48,461 INFO L796 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 24#L508-8true [2020-07-29 01:31:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2020-07-29 01:31:48,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470938508] [2020-07-29 01:31:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2020-07-29 01:31:48,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364898041] [2020-07-29 01:31:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2020-07-29 01:31:48,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968218036] [2020-07-29 01:31:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,886 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:50,395 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 190 DAG size of output: 150 [2020-07-29 01:31:51,010 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-29 01:31:51,023 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:51,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:51,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:51,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:51,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:51,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:51,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:51,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:51,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration1_Lasso [2020-07-29 01:31:51,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:51,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:51,098 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 01:31:51,105 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 01:31:51,109 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 01:31:51,114 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 01:31:51,118 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 01:31:51,121 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 01:31:51,125 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 01:31:51,128 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 01:31:51,132 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 01:31:51,135 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 01:31:51,138 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 01:31:51,142 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 01:31:51,145 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 01:31:51,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:51,152 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 01:31:51,156 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 01:31:52,076 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2020-07-29 01:31:52,320 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-07-29 01:31:52,328 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 01:31:52,331 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 01:31:52,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 01:31:52,350 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 01:31:52,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 01:31:52,357 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 01:31:52,361 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 01:31:52,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:52,373 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 01:31:52,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 01:31:52,379 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 01:31:52,383 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 01:31:52,388 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 01:31:52,912 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-29 01:31:53,178 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-07-29 01:31:53,761 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-07-29 01:31:54,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:54,049 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 01:31:54,060 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 01:31:54,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,066 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:31:54,068 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 01:31:54,113 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 01:31:54,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,116 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 01:31:54,120 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:54,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 01:31:54,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:54,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:54,165 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:54,190 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 01:31:54,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,194 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 01:31:54,218 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 01:31:54,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,224 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 01:31:54,258 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 01:31:54,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,264 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 01:31:54,293 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 01:31:54,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,297 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 01:31:54,321 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 01:31:54,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,325 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 01:31:54,348 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 01:31:54,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,352 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 01:31:54,382 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 01:31:54,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,385 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:54,411 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 01:31:54,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,416 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 01:31:54,439 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 01:31:54,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,442 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 01:31:54,467 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 01:31:54,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,472 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 01:31:54,495 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 01:31:54,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,499 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 01:31:54,524 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 01:31:54,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,532 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 01:31:54,565 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 01:31:54,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:54,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:54,591 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:54,624 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 01:31:54,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:54,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:54,671 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 01:31:54,702 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 01:31:54,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:54,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:54,711 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 01:31:54,747 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 01:31:54,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:54,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:54,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:54,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:54,753 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:54,821 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 01:31:54,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:54,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:54,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:54,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:54,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:54,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:54,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:54,985 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:31:54,985 INFO L444 ModelExtractionUtils]: 55 out of 76 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:55,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:55,063 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:31:55,063 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:55,064 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2020-07-29 01:31:55,379 INFO L297 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2020-07-29 01:31:55,387 INFO L393 LassoCheck]: Loop: "strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1);" "assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;" [2020-07-29 01:31:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:55,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:31:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:55,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:31:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:55,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:55,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#unseeded} is VALID [2020-07-29 01:31:55,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#unseeded} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {36#unseeded} is VALID [2020-07-29 01:31:55,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#unseeded} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {36#unseeded} is VALID [2020-07-29 01:31:55,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {36#unseeded} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:31:55,572 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:31:55,573 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} assume build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:31:55,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#(and (= ULTIMATE.start_build_fullname_~filename.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {240#(and (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:31:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:55,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:31:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:55,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:55,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#(and (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_main_#t~malloc22.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (* (- 1) ULTIMATE.start_strcpy_~s2.offset))))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {268#(and (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_main_#t~malloc22.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) 1) (+ oldRank0 ULTIMATE.start_strcpy_~s2.offset)))} is VALID [2020-07-29 01:31:55,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(and (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_main_#t~malloc22.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) 1) (+ oldRank0 ULTIMATE.start_strcpy_~s2.offset)))} assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {243#(and (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_main_#t~malloc22.base|) (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (* (- 1) ULTIMATE.start_strcpy_~s2.offset))) (>= oldRank0 0))))} is VALID [2020-07-29 01:31:55,798 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 01:31:55,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:31:55,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:55,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:55,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:55,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:31:55,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2020-07-29 01:31:56,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 4 states. Result 51 states and 69 transitions. Complement of second has 7 states. [2020-07-29 01:31:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:56,032 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:56,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-07-29 01:31:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 01:31:56,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:56,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:56,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:31:56,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:31:56,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:56,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:56,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 69 transitions. [2020-07-29 01:31:56,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:31:56,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:56,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:56,049 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states. [2020-07-29 01:31:56,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 01:31:56,054 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:31:56,054 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:31:56,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:31:56,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:56,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 69 transitions. cyclomatic complexity: 23 [2020-07-29 01:31:56,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:31:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:31:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:31:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 51 letters. Loop has 51 letters. [2020-07-29 01:31:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:31:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:31:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:31:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:31:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:31:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:31:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:56,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:31:56,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:31:56,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:31:56,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:31:56,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:31:56,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:31:56,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 69 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,090 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:31:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-29 01:31:56,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:56,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:31:56,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:31:56,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:56,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. cyclomatic complexity: 23 [2020-07-29 01:31:56,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:31:56,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 15 states and 18 transitions. [2020-07-29 01:31:56,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:31:56,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:31:56,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2020-07-29 01:31:56,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:56,108 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:31:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2020-07-29 01:31:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 01:31:56,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:56,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:31:56,134 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:31:56,136 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 15 states. [2020-07-29 01:31:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:56,140 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:31:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:31:56,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:56,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:56,142 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 18 transitions. [2020-07-29 01:31:56,142 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 18 transitions. [2020-07-29 01:31:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:56,143 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:31:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:31:56,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:56,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:56,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:56,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:31:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 01:31:56,146 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:31:56,147 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:31:56,147 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:31:56,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:31:56,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:31:56,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:56,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:56,148 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:31:56,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:31:56,149 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 345#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 346#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 341#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 342#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 347#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 343#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 344#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 334#L508-3 [2020-07-29 01:31:56,149 INFO L796 eck$LassoCheckResult]: Loop: 334#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 335#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 334#L508-3 [2020-07-29 01:31:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2020-07-29 01:31:56,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:56,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877972174] [2020-07-29 01:31:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:56,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {382#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {382#true} is VALID [2020-07-29 01:31:56,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {382#true} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {382#true} is VALID [2020-07-29 01:31:56,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {382#true} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {382#true} is VALID [2020-07-29 01:31:56,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#true} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {384#(or (not (= 46 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset))) (not |ULTIMATE.start_build_fullname_#t~short10|))} is VALID [2020-07-29 01:31:56,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {384#(or (not (= 46 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset))) (not |ULTIMATE.start_build_fullname_#t~short10|))} assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; {385#(not (= 46 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset)))} is VALID [2020-07-29 01:31:56,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {385#(not (= 46 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset)))} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {386#|ULTIMATE.start_build_fullname_#t~short14|} is VALID [2020-07-29 01:31:56,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {386#|ULTIMATE.start_build_fullname_#t~short14|} assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; {383#false} is VALID [2020-07-29 01:31:56,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {383#false} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {383#false} is VALID [2020-07-29 01:31:56,259 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 01:31:56,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877972174] [2020-07-29 01:31:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:31:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:31:56,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719177283] [2020-07-29 01:31:56,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:31:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2020-07-29 01:31:56,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:56,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590576651] [2020-07-29 01:31:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,277 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:56,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:56,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:31:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:31:56,405 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:31:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:56,541 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:31:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:31:56,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:56,555 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 01:31:56,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-07-29 01:31:56,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:31:56,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2020-07-29 01:31:56,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 01:31:56,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:31:56,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2020-07-29 01:31:56,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:56,559 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:31:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2020-07-29 01:31:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2020-07-29 01:31:56,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:56,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand 17 states. [2020-07-29 01:31:56,561 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand 17 states. [2020-07-29 01:31:56,561 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 17 states. [2020-07-29 01:31:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:56,563 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:31:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:31:56,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:56,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:56,563 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states and 23 transitions. [2020-07-29 01:31:56,563 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states and 23 transitions. [2020-07-29 01:31:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:56,565 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-29 01:31:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-29 01:31:56,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:56,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:56,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:56,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:31:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 01:31:56,567 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:31:56,567 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:31:56,567 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:31:56,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:31:56,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:31:56,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:56,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:56,568 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:31:56,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:31:56,568 INFO L794 eck$LassoCheckResult]: Stem: 426#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 422#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 423#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 418#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 419#L521 assume !build_fullname_#t~short10; 424#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 427#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 421#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 411#L508-3 [2020-07-29 01:31:56,569 INFO L796 eck$LassoCheckResult]: Loop: 411#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 412#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 411#L508-3 [2020-07-29 01:31:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2020-07-29 01:31:56,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:56,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072126136] [2020-07-29 01:31:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2020-07-29 01:31:56,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:56,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600744616] [2020-07-29 01:31:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2020-07-29 01:31:56,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:56,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956856085] [2020-07-29 01:31:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:56,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:56,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:57,661 WARN L193 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 148 [2020-07-29 01:31:58,007 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-07-29 01:31:58,011 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:58,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:58,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:58,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:58,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:58,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:58,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:58,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:58,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration3_Lasso [2020-07-29 01:31:58,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:58,012 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:58,057 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 01:31:58,061 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 01:31:58,064 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 01:31:58,074 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 01:31:58,077 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 01:31:58,087 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 01:31:58,090 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 01:31:58,093 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 01:31:58,096 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 01:31:58,099 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 01:31:58,103 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 01:31:58,106 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 01:31:58,110 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 01:31:58,114 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 01:31:58,117 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 01:31:58,120 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 01:31:58,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:58,127 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 01:31:58,132 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 01:31:58,135 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 01:31:58,137 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 01:31:58,141 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 01:31:58,149 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 01:31:58,153 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 01:31:58,161 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 01:31:58,164 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 01:31:58,167 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 01:31:59,014 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 119 [2020-07-29 01:31:59,239 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2020-07-29 01:31:59,249 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 01:31:59,251 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 01:31:59,255 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 01:31:59,775 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-29 01:32:00,056 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-29 01:32:00,602 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-29 01:32:00,859 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:00,859 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:00,864 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 01:32:00,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:00,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:00,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:00,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:00,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:00,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:00,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:00,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:00,891 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 01:32:00,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:00,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:00,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:00,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:00,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:00,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:00,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:00,896 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:00,919 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 01:32:00,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:00,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:00,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:00,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:00,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:00,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:00,926 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:00,964 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 01:32:00,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:00,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:00,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:00,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:00,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:00,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:00,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:00,968 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:01,002 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 01:32:01,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32: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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:01,030 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,035 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,062 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 01:32:01,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,068 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,091 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 01:32:01,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,094 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,118 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 01:32:01,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,121 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,143 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 01:32:01,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,147 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,168 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 01:32:01,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,172 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,196 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 01:32:01,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,204 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,226 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 01:32:01,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,234 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,256 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 01:32:01,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,260 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,285 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 01:32:01,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,289 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,312 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 01:32:01,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,316 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,338 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 01:32:01,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,343 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:01,376 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 01:32:01,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,385 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,428 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 01:32:01,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,437 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,460 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 01:32:01,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,463 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,486 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 01:32:01,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,490 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,513 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 01:32:01,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,516 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,543 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 01:32:01,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,571 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 01:32:01,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,574 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,596 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 01:32:01,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,599 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,621 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 01:32:01,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:01,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:01,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:01,625 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,646 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 01:32:01,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,653 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,676 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 01:32:01,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,714 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,736 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 01:32:01,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,778 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 01:32:01,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,789 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:01,822 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 01:32:01,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,839 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,873 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 01:32:01,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,874 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:32:01,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,877 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 01:32:01,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,882 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,905 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 01:32:01,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:01,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:01,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:01,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:01,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:01,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:01,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:01,988 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:32:01,988 INFO L444 ModelExtractionUtils]: 39 out of 61 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:01,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:01,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:01,992 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:01,992 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2020-07-29 01:32:02,197 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2020-07-29 01:32:02,203 INFO L393 LassoCheck]: Loop: "strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1);" "assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;" [2020-07-29 01:32:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:32:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:02,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {477#unseeded} is VALID [2020-07-29 01:32:02,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#unseeded} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {477#unseeded} is VALID [2020-07-29 01:32:02,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {477#unseeded} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {477#unseeded} is VALID [2020-07-29 01:32:02,301 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#unseeded} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:02,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !build_fullname_#t~short10; {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:02,303 INFO L280 TraceCheckUtils]: 5: Hoare triple {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:02,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:02,305 INFO L280 TraceCheckUtils]: 7: Hoare triple {679#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {661#(and (= ULTIMATE.start_strcpy_~s1.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:32:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:02,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {662#(and (= ULTIMATE.start_strcpy_~s1.base |ULTIMATE.start_main_#t~malloc23.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_strcpy_~s1.offset) (select |#length| |ULTIMATE.start_main_#t~malloc23.base|))))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {692#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) 1) (+ (select |#length| ULTIMATE.start_strcpy_~s1.base) oldRank0)) (= ULTIMATE.start_strcpy_~s1.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) 1) (+ oldRank0 ULTIMATE.start_strcpy_~s1.offset)))} is VALID [2020-07-29 01:32:02,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {692#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) 1) (+ (select |#length| ULTIMATE.start_strcpy_~s1.base) oldRank0)) (= ULTIMATE.start_strcpy_~s1.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) 1) (+ oldRank0 ULTIMATE.start_strcpy_~s1.offset)))} assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {664#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_strcpy_~s1.offset) (select |#length| |ULTIMATE.start_main_#t~malloc23.base|))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_strcpy_~s1.base |ULTIMATE.start_main_#t~malloc23.base|))} is VALID [2020-07-29 01:32:02,430 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 01:32:02,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:32:02,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:02,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:32:02,446 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:32:02,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 5 states. [2020-07-29 01:32:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:02,523 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:02,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:02,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:32:02,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:02,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:32:02,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:02,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:02,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:32:02,528 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:32:02,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:02,529 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:02,529 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 28 transitions. cyclomatic complexity: 7 [2020-07-29 01:32:02,530 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:32:02,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:02,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:02,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:32:02,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:02,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:02,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:02,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:02,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:02,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:02,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:02,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:02,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:32:02,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:32:02,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:02,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,543 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:32:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 01:32:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:32:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:32:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:32:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:02,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. cyclomatic complexity: 7 [2020-07-29 01:32:02,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:02,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2020-07-29 01:32:02,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:32:02,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:32:02,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-07-29 01:32:02,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:02,548 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:32:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-07-29 01:32:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:32:02,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:02,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand 18 states. [2020-07-29 01:32:02,549 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand 18 states. [2020-07-29 01:32:02,549 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 18 states. [2020-07-29 01:32:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:02,550 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 01:32:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:32:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:02,551 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 21 transitions. [2020-07-29 01:32:02,551 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 21 transitions. [2020-07-29 01:32:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:02,552 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 01:32:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:32:02,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:02,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:02,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:02,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:32:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-07-29 01:32:02,554 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:32:02,554 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:32:02,554 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:32:02,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:32:02,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:02,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:02,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:02,556 INFO L794 eck$LassoCheckResult]: Stem: 745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 741#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 742#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 737#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 738#L521 assume !build_fullname_#t~short10; 743#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 746#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 740#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 729#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 730#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 734#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 735#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 736#L514-2 [2020-07-29 01:32:02,556 INFO L796 eck$LassoCheckResult]: Loop: 736#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 732#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 733#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 736#L514-2 [2020-07-29 01:32:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2020-07-29 01:32:02,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820813030] [2020-07-29 01:32:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:02,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {786#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {786#true} is VALID [2020-07-29 01:32:02,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {786#true} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {786#true} is VALID [2020-07-29 01:32:02,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {786#true} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {786#true} is VALID [2020-07-29 01:32:02,638 INFO L280 TraceCheckUtils]: 3: Hoare triple {786#true} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {786#true} is VALID [2020-07-29 01:32:02,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {786#true} assume !build_fullname_#t~short10; {786#true} is VALID [2020-07-29 01:32:02,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {786#true} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {788#(or (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset))) |ULTIMATE.start_build_fullname_#t~short14|)} is VALID [2020-07-29 01:32:02,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {788#(or (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset))) |ULTIMATE.start_build_fullname_#t~short14|)} assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; {789#(not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset)))} is VALID [2020-07-29 01:32:02,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {789#(not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) ULTIMATE.start_build_fullname_~directory.offset)))} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {790#(not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) ULTIMATE.start_strcpy_~s2.offset)))} is VALID [2020-07-29 01:32:02,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {790#(not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) ULTIMATE.start_strcpy_~s2.offset)))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {791#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} is VALID [2020-07-29 01:32:02,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {791#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {787#false} is VALID [2020-07-29 01:32:02,643 INFO L280 TraceCheckUtils]: 10: Hoare triple {787#false} strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; {787#false} is VALID [2020-07-29 01:32:02,643 INFO L280 TraceCheckUtils]: 11: Hoare triple {787#false} build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); {787#false} is VALID [2020-07-29 01:32:02,644 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 01:32:02,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820813030] [2020-07-29 01:32:02,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:02,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:32:02,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609434256] [2020-07-29 01:32:02,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2020-07-29 01:32:02,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894479538] [2020-07-29 01:32:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:02,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:32:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:32:02,698 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 01:32:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:02,872 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:32:02,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:32:02,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:02,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-07-29 01:32:02,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:02,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-07-29 01:32:02,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:32:02,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:32:02,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-07-29 01:32:02,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:02,892 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-29 01:32:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-07-29 01:32:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 01:32:02,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:02,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 25 transitions. Second operand 21 states. [2020-07-29 01:32:02,894 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 25 transitions. Second operand 21 states. [2020-07-29 01:32:02,894 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 21 states. [2020-07-29 01:32:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:02,895 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-29 01:32:02,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:02,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:02,896 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 25 transitions. [2020-07-29 01:32:02,896 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 25 transitions. [2020-07-29 01:32:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:02,897 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-29 01:32:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:02,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:02,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:02,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:32:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-29 01:32:02,899 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-29 01:32:02,899 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-29 01:32:02,899 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:32:02,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2020-07-29 01:32:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:02,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:02,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:02,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:02,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:02,901 INFO L794 eck$LassoCheckResult]: Stem: 838#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 833#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 834#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 829#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 830#L521 assume !build_fullname_#t~short10; 836#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 840#L523 assume build_fullname_#t~short14; 832#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 839#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 823#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 826#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 827#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 828#L514-2 [2020-07-29 01:32:02,901 INFO L796 eck$LassoCheckResult]: Loop: 828#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 824#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 825#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 828#L514-2 [2020-07-29 01:32:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2020-07-29 01:32:02,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804635717] [2020-07-29 01:32:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2020-07-29 01:32:02,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245977015] [2020-07-29 01:32:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:02,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:02,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2020-07-29 01:32:02,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:02,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721349855] [2020-07-29 01:32:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:03,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {892#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {892#true} is VALID [2020-07-29 01:32:03,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {892#true} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {892#true} is VALID [2020-07-29 01:32:03,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {892#true} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {892#true} is VALID [2020-07-29 01:32:03,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {892#true} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {892#true} is VALID [2020-07-29 01:32:03,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {892#true} assume !build_fullname_#t~short10; {892#true} is VALID [2020-07-29 01:32:03,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {892#true} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {892#true} is VALID [2020-07-29 01:32:03,061 INFO L280 TraceCheckUtils]: 6: Hoare triple {892#true} assume build_fullname_#t~short14; {892#true} is VALID [2020-07-29 01:32:03,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {892#true} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {894#(and (= ULTIMATE.start_strcpy_~s1.base ULTIMATE.start_build_fullname_~dest~0.base) (= ULTIMATE.start_build_fullname_~dest~0.offset ULTIMATE.start_strcpy_~s1.offset))} is VALID [2020-07-29 01:32:03,063 INFO L280 TraceCheckUtils]: 8: Hoare triple {894#(and (= ULTIMATE.start_strcpy_~s1.base ULTIMATE.start_build_fullname_~dest~0.base) (= ULTIMATE.start_build_fullname_~dest~0.offset ULTIMATE.start_strcpy_~s1.offset))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {895#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) |ULTIMATE.start_strcpy_#t~mem4|)} is VALID [2020-07-29 01:32:03,064 INFO L280 TraceCheckUtils]: 9: Hoare triple {895#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) |ULTIMATE.start_strcpy_#t~mem4|)} assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {896#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) 0)} is VALID [2020-07-29 01:32:03,064 INFO L280 TraceCheckUtils]: 10: Hoare triple {896#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) 0)} strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; {896#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) 0)} is VALID [2020-07-29 01:32:03,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {896#(= (select (select |#memory_int| ULTIMATE.start_build_fullname_~dest~0.base) ULTIMATE.start_build_fullname_~dest~0.offset) 0)} build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); {897#(= 0 (select (select |#memory_int| ULTIMATE.start_strchr_~t.base) ULTIMATE.start_strchr_~t.offset))} is VALID [2020-07-29 01:32:03,066 INFO L280 TraceCheckUtils]: 12: Hoare triple {897#(= 0 (select (select |#memory_int| ULTIMATE.start_strchr_~t.base) ULTIMATE.start_strchr_~t.offset))} assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); {897#(= 0 (select (select |#memory_int| ULTIMATE.start_strchr_~t.base) ULTIMATE.start_strchr_~t.offset))} is VALID [2020-07-29 01:32:03,076 INFO L280 TraceCheckUtils]: 13: Hoare triple {897#(= 0 (select (select |#memory_int| ULTIMATE.start_strchr_~t.base) ULTIMATE.start_strchr_~t.offset))} assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); {898#(= 0 |ULTIMATE.start_strchr_#t~mem6|)} is VALID [2020-07-29 01:32:03,077 INFO L280 TraceCheckUtils]: 14: Hoare triple {898#(= 0 |ULTIMATE.start_strchr_#t~mem6|)} assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; {893#false} is VALID [2020-07-29 01:32:03,079 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 01:32:03,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721349855] [2020-07-29 01:32:03,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:03,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:32:03,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609887905] [2020-07-29 01:32:03,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:03,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:32:03,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:32:03,128 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-07-29 01:32:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:03,354 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-29 01:32:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:32:03,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:32:03,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:03,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2020-07-29 01:32:03,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:03,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 25 transitions. [2020-07-29 01:32:03,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:32:03,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:32:03,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-07-29 01:32:03,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:03,379 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-07-29 01:32:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-07-29 01:32:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2020-07-29 01:32:03,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:03,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 25 transitions. Second operand 19 states. [2020-07-29 01:32:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 25 transitions. Second operand 19 states. [2020-07-29 01:32:03,382 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 19 states. [2020-07-29 01:32:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:03,383 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-29 01:32:03,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:03,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:03,384 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states and 25 transitions. [2020-07-29 01:32:03,384 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states and 25 transitions. [2020-07-29 01:32:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:03,386 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-07-29 01:32:03,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:03,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:03,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:03,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:32:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-29 01:32:03,388 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-29 01:32:03,388 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-29 01:32:03,388 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:32:03,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2020-07-29 01:32:03,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:03,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:03,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:03,390 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:03,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:03,390 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 943#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 944#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 939#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 940#L521 assume !build_fullname_#t~short10; 945#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 948#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 942#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 930#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 931#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 932#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 933#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 936#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 937#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 938#L514-2 [2020-07-29 01:32:03,390 INFO L796 eck$LassoCheckResult]: Loop: 938#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 934#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 935#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 938#L514-2 [2020-07-29 01:32:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash 761840220, now seen corresponding path program 1 times [2020-07-29 01:32:03,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:03,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614993172] [2020-07-29 01:32:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:03,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {996#true} is VALID [2020-07-29 01:32:03,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {996#true} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {996#true} is VALID [2020-07-29 01:32:03,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {996#true} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {996#true} is VALID [2020-07-29 01:32:03,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {996#true} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} is VALID [2020-07-29 01:32:03,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} assume !build_fullname_#t~short10; {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} is VALID [2020-07-29 01:32:03,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} is VALID [2020-07-29 01:32:03,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {998#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (= 0 ULTIMATE.start_build_fullname_~dest~0.offset))} assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; {999#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (or (and (= 0 ULTIMATE.start_build_fullname_~dest~0.offset) (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))))) (not |ULTIMATE.start_build_fullname_#t~short14|)))} is VALID [2020-07-29 01:32:03,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {999#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (or (and (= 0 ULTIMATE.start_build_fullname_~dest~0.offset) (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))))) (not |ULTIMATE.start_build_fullname_#t~short14|)))} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {1000#(and (= 0 ULTIMATE.start_strcpy_~s1.offset) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))) (= 0 ULTIMATE.start_strcpy_~s2.offset))} is VALID [2020-07-29 01:32:03,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {1000#(and (= 0 ULTIMATE.start_strcpy_~s1.offset) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))) (= 0 ULTIMATE.start_strcpy_~s2.offset))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} is VALID [2020-07-29 01:32:03,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} is VALID [2020-07-29 01:32:03,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1002#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} is VALID [2020-07-29 01:32:03,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {1002#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {997#false} is VALID [2020-07-29 01:32:03,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#false} strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; {997#false} is VALID [2020-07-29 01:32:03,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {997#false} build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); {997#false} is VALID [2020-07-29 01:32:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:03,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614993172] [2020-07-29 01:32:03,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902079293] [2020-07-29 01:32:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:32:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:03,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 67 conjunts are in the unsatisfiable core [2020-07-29 01:32:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:03,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:03,877 INFO L350 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2020-07-29 01:32:03,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2020-07-29 01:32:03,884 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:03,895 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:03,901 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:32:03,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2020-07-29 01:32:03,907 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:03,907 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_119|, ULTIMATE.start_main_~file~0.base]. (let ((.cse0 (store (store |v_#valid_119| ULTIMATE.start_build_fullname_~directory.base 1) ULTIMATE.start_main_~file~0.base 1))) (and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (<= (select .cse0 ULTIMATE.start_build_fullname_~dest~0.base) 0) (= |#valid| (store .cse0 ULTIMATE.start_build_fullname_~dest~0.base 1)))) [2020-07-29 01:32:03,908 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~file~0.base]. (and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= (select |#valid| ULTIMATE.start_main_~file~0.base) 1) (not (= ULTIMATE.start_main_~file~0.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base))) [2020-07-29 01:32:04,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 01:32:04,105 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:04,113 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:04,119 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2020-07-29 01:32:04,120 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:04,128 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:04,138 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:04,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:12 [2020-07-29 01:32:04,142 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:04,142 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_144|, |ULTIMATE.start_strcpy_#t~post2.base|, |ULTIMATE.start_strcpy_#t~post2.offset|, |ULTIMATE.start_strcpy_#t~mem4|, |#valid|]. (and (not (= 0 (select (select |v_#memory_int_144| ULTIMATE.start_strcpy_~s2.base) 1))) (= (store |v_#memory_int_144| |ULTIMATE.start_strcpy_#t~post2.base| (store (select |v_#memory_int_144| |ULTIMATE.start_strcpy_#t~post2.base|) |ULTIMATE.start_strcpy_#t~post2.offset| |ULTIMATE.start_strcpy_#t~mem4|)) |#memory_int|) (= 1 (select |#valid| |ULTIMATE.start_strcpy_#t~post2.base|)) (= 1 ULTIMATE.start_strcpy_~s2.offset) (= 1 (select |#valid| ULTIMATE.start_strcpy_~s2.base)) (not (= ULTIMATE.start_strcpy_~s2.base |ULTIMATE.start_strcpy_#t~post2.base|))) [2020-07-29 01:32:04,142 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 ULTIMATE.start_strcpy_~s2.offset) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1)))) [2020-07-29 01:32:04,189 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 01:32:04,192 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:04,192 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2020-07-29 01:32:04,194 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:04,200 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:04,210 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:04,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:4 [2020-07-29 01:32:04,213 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:04,213 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_145|, |ULTIMATE.start_strcpy_#t~post3.base|, |ULTIMATE.start_strcpy_#t~post3.offset|]. (let ((.cse0 (select |v_#memory_int_145| |ULTIMATE.start_strcpy_#t~post3.base|))) (and (not (= 0 (select .cse0 1))) (<= |ULTIMATE.start_strcpy_#t~post3.offset| 1) (= (select .cse0 |ULTIMATE.start_strcpy_#t~post3.offset|) |ULTIMATE.start_strcpy_#t~mem4|) (<= 1 |ULTIMATE.start_strcpy_#t~post3.offset|))) [2020-07-29 01:32:04,214 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= 0 |ULTIMATE.start_strcpy_#t~mem4|)) [2020-07-29 01:32:04,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {996#true} is VALID [2020-07-29 01:32:04,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {996#true} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {996#true} is VALID [2020-07-29 01:32:04,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {996#true} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {996#true} is VALID [2020-07-29 01:32:04,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {996#true} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} is VALID [2020-07-29 01:32:04,219 INFO L280 TraceCheckUtils]: 4: Hoare triple {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} assume !build_fullname_#t~short10; {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} is VALID [2020-07-29 01:32:04,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} is VALID [2020-07-29 01:32:04,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {1015#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; {1025#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (or (and |ULTIMATE.start_build_fullname_#t~short14| (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))))) (and (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))) (not |ULTIMATE.start_build_fullname_#t~short14|))) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} is VALID [2020-07-29 01:32:04,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {1025#(and (= 0 ULTIMATE.start_build_fullname_~directory.offset) (not (= ULTIMATE.start_build_fullname_~directory.base ULTIMATE.start_build_fullname_~dest~0.base)) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~dest~0.base)) (or (and |ULTIMATE.start_build_fullname_#t~short14| (not (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))))) (and (= 0 (select (select |#memory_int| ULTIMATE.start_build_fullname_~directory.base) (+ ULTIMATE.start_build_fullname_~directory.offset 1))) (not |ULTIMATE.start_build_fullname_#t~short14|))) (= 1 (select |#valid| ULTIMATE.start_build_fullname_~directory.base)))} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {1029#(and (not (= ULTIMATE.start_strcpy_~s1.base ULTIMATE.start_strcpy_~s2.base)) (= 1 (select |#valid| ULTIMATE.start_strcpy_~s2.base)) (= 1 (select |#valid| ULTIMATE.start_strcpy_~s1.base)) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))) (= 0 ULTIMATE.start_strcpy_~s2.offset))} is VALID [2020-07-29 01:32:04,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {1029#(and (not (= ULTIMATE.start_strcpy_~s1.base ULTIMATE.start_strcpy_~s2.base)) (= 1 (select |#valid| ULTIMATE.start_strcpy_~s2.base)) (= 1 (select |#valid| ULTIMATE.start_strcpy_~s1.base)) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))) (= 0 ULTIMATE.start_strcpy_~s2.offset))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} is VALID [2020-07-29 01:32:04,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} is VALID [2020-07-29 01:32:04,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {1001#(and (<= 1 ULTIMATE.start_strcpy_~s2.offset) (<= ULTIMATE.start_strcpy_~s2.offset 1) (not (= 0 (select (select |#memory_int| ULTIMATE.start_strcpy_~s2.base) 1))))} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1002#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} is VALID [2020-07-29 01:32:04,228 INFO L280 TraceCheckUtils]: 11: Hoare triple {1002#(not (= 0 |ULTIMATE.start_strcpy_#t~mem4|))} assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {997#false} is VALID [2020-07-29 01:32:04,228 INFO L280 TraceCheckUtils]: 12: Hoare triple {997#false} strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; {997#false} is VALID [2020-07-29 01:32:04,228 INFO L280 TraceCheckUtils]: 13: Hoare triple {997#false} build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); {997#false} is VALID [2020-07-29 01:32:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:04,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:32:04,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-29 01:32:04,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387341088] [2020-07-29 01:32:04,231 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2020-07-29 01:32:04,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:04,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206775793] [2020-07-29 01:32:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:04,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:04,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:04,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:04,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:32:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:32:04,298 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-07-29 01:32:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:05,074 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-29 01:32:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:32:05,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:32:05,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:05,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2020-07-29 01:32:05,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:05,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2020-07-29 01:32:05,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:32:05,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:32:05,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2020-07-29 01:32:05,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:05,114 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-29 01:32:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2020-07-29 01:32:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-29 01:32:05,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:05,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 28 transitions. Second operand 23 states. [2020-07-29 01:32:05,116 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 28 transitions. Second operand 23 states. [2020-07-29 01:32:05,116 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 23 states. [2020-07-29 01:32:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:05,117 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-29 01:32:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-29 01:32:05,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:05,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:05,118 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states and 28 transitions. [2020-07-29 01:32:05,118 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states and 28 transitions. [2020-07-29 01:32:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:05,119 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-29 01:32:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-29 01:32:05,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:05,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:05,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:05,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:32:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-29 01:32:05,121 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-29 01:32:05,121 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-29 01:32:05,121 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:32:05,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2020-07-29 01:32:05,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:32:05,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:05,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:05,123 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:05,123 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:05,123 INFO L794 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1096#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1097#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 1092#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 1093#L521 assume !build_fullname_#t~short10; 1098#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 1106#L523 assume build_fullname_#t~short14; 1095#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1084#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1085#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 1101#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1102#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; 1089#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 1090#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 1091#L514-2 [2020-07-29 01:32:05,123 INFO L796 eck$LassoCheckResult]: Loop: 1091#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 1087#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 1088#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 1091#L514-2 [2020-07-29 01:32:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2020-07-29 01:32:05,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:05,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028344509] [2020-07-29 01:32:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 4 times [2020-07-29 01:32:05,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:05,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382054463] [2020-07-29 01:32:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2020-07-29 01:32:05,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:05,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734679737] [2020-07-29 01:32:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:05,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:05,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:07,145 WARN L193 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 274 DAG size of output: 226 [2020-07-29 01:32:09,909 WARN L193 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 178 DAG size of output: 169 [2020-07-29 01:32:09,922 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:09,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:09,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:09,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:09,922 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:09,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:09,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:09,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:09,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: build_fullname.i_Iteration7_Lasso [2020-07-29 01:32:09,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:09,923 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:09,962 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 01:32:09,965 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 01:32:09,968 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 01:32:09,971 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 01:32:09,975 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 01:32:09,981 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 01:32:09,985 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 01:32:09,989 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 01:32:09,992 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 01:32:09,996 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 01:32:10,000 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 01:32:10,004 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 01:32:10,010 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 01:32:10,014 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 01:32:10,019 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 01:32:10,023 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 01:32:10,027 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 01:32:10,031 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 01:32:10,035 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 01:32:10,039 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 01:32:10,043 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 01:32:10,047 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 01:32:10,051 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 01:32:10,055 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 01:32:10,059 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 01:32:10,063 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 01:32:10,068 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 01:32:10,073 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 01:32:10,077 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 01:32:11,267 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 141 [2020-07-29 01:32:11,404 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-07-29 01:32:11,413 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 01:32:11,415 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 01:32:11,419 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 01:32:11,422 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 01:32:12,163 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2020-07-29 01:32:12,408 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 01:32:12,781 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-07-29 01:32:13,028 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-29 01:32:13,225 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:13,225 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:13,229 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 01:32:13,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,233 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:13,255 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 01:32:13,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,259 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,283 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 01:32:13,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,285 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,308 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 01:32:13,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,311 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,335 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 01:32:13,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,337 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,361 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 01:32:13,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,363 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,385 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 01:32:13,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,388 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,410 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 01:32:13,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,413 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,436 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 01:32:13,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,439 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,461 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 01:32:13,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,464 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:13,487 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 01:32:13,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,494 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,516 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 01:32:13,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:13,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:13,522 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,544 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 01:32:13,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,569 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 01:32:13,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,572 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,594 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 01:32:13,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,596 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,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 01:32:13,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,639 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,661 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 01:32:13,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,664 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,685 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 01:32:13,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,688 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,711 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 01:32:13,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,714 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,736 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 01:32:13,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,739 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,761 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 01:32:13,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,764 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,787 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 01:32:13,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,790 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,812 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 01:32:13,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,815 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,838 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 01:32:13,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,841 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:13,862 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,866 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,889 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 01:32:13,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:13,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:13,894 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,917 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 01:32:13,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,920 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,942 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 01:32:13,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:13,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:13,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:13,947 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,970 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 01:32:13,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:13,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:13,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:13,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:13,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:13,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:13,975 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:13,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 01:32:14,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:14,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:14,008 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,034 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 01:32:14,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:14,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:14,040 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,062 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 01:32:14,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:14,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:14,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:14,201 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2020-07-29 01:32:14,201 INFO L444 ModelExtractionUtils]: 45 out of 73 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:14,206 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:14,206 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:14,206 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3, ULTIMATE.start_strchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 - 1*ULTIMATE.start_strchr_~t.offset Supporting invariants [] [2020-07-29 01:32:14,437 INFO L297 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2020-07-29 01:32:14,441 INFO L393 LassoCheck]: Loop: "assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1);" "assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1);" "assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset;" [2020-07-29 01:32:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:14,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:14,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:32:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:14,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:14,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {1166#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1166#unseeded} is VALID [2020-07-29 01:32:14,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#unseeded} havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {1166#unseeded} is VALID [2020-07-29 01:32:14,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {1166#unseeded} assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; {1166#unseeded} is VALID [2020-07-29 01:32:14,549 INFO L280 TraceCheckUtils]: 3: Hoare triple {1166#unseeded} assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,550 INFO L280 TraceCheckUtils]: 4: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !build_fullname_#t~short10; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume build_fullname_#t~short14; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem13;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,555 INFO L280 TraceCheckUtils]: 10: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {1398#(and (= ULTIMATE.start_build_fullname_~dest~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); {1380#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 01:32:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:14,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:14,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:14,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {1381#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (* (- 1) ULTIMATE.start_strchr_~t.offset))) (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|))} assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); {1429#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ ULTIMATE.start_strchr_~t.offset oldRank0)) (<= (+ ULTIMATE.start_strchr_~t.offset 1) (select |#length| ULTIMATE.start_strchr_~t.base)))} is VALID [2020-07-29 01:32:14,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {1429#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ ULTIMATE.start_strchr_~t.offset oldRank0)) (<= (+ ULTIMATE.start_strchr_~t.offset 1) (select |#length| ULTIMATE.start_strchr_~t.base)))} assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); {1429#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ ULTIMATE.start_strchr_~t.offset oldRank0)) (<= (+ ULTIMATE.start_strchr_~t.offset 1) (select |#length| ULTIMATE.start_strchr_~t.base)))} is VALID [2020-07-29 01:32:14,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {1429#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ ULTIMATE.start_strchr_~t.offset oldRank0)) (<= (+ ULTIMATE.start_strchr_~t.offset 1) (select |#length| ULTIMATE.start_strchr_~t.base)))} assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; {1383#(and (= ULTIMATE.start_strchr_~t.base |ULTIMATE.start_main_#t~malloc23.base|) (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (* (- 1) ULTIMATE.start_strchr_~t.offset))) (>= oldRank0 0))))} is VALID [2020-07-29 01:32:14,599 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 01:32:14,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:32:14,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:14,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,622 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:32:14,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:32:14,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 26 states and 30 transitions. Complement of second has 5 states. [2020-07-29 01:32:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:14,699 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:14,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:14,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:14,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:14,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:32:14,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:14,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:14,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:14,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2020-07-29 01:32:14,701 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:14,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:14,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 26 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:14,702 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:32:14,702 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:32:14,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:14,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:14,703 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 30 transitions. cyclomatic complexity: 6 [2020-07-29 01:32:14,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. cyclomatic complexity: 6 [2020-07-29 01:32:14,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:14,708 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:32:14,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:14,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:14,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:32:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:32:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:32:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:32:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:14,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:32:14,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:14,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:14,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:14,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:14,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:14,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:14,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 26 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 30 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:14,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,715 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:32:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:32:14,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:14,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:14,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:32:14,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:14,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. cyclomatic complexity: 6 [2020-07-29 01:32:14,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:14,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-07-29 01:32:14,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:32:14,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:32:14,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:32:14,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:14,719 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:14,720 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:14,720 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:14,720 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:32:14,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:32:14,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:14,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:14,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:32:14 BoogieIcfgContainer [2020-07-29 01:32:14,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:32:14,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:32:14,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:32:14,728 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:32:14,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:48" (3/4) ... [2020-07-29 01:32:14,731 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:32:14,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:32:14,732 INFO L168 Benchmark]: Toolchain (without parser) took 27664.78 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 552.6 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -292.7 MB). Peak memory consumption was 259.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:14,732 INFO L168 Benchmark]: CDTParser took 1.06 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 01:32:14,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:14,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:14,734 INFO L168 Benchmark]: Boogie Preprocessor took 38.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:14,735 INFO L168 Benchmark]: RCFGBuilder took 601.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:14,735 INFO L168 Benchmark]: BuchiAutomizer took 26373.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 423.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -201.4 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:14,735 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:14,738 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 1.06 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 569.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 601.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26373.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 423.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -201.4 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (file_len)] + -1 * s2 and consists of 5 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] + -1 * t and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 23.4s. Construction of modules took 0.4s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 111 SDtfs, 99 SDslu, 169 SDs, 0 SdLazy, 221 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital466 mio100 ax100 hnf99 lsp98 ukn64 mio100 lsp44 div100 bol100 ite100 ukn100 eq199 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...