./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78f95c70d702e3726c098ef8eec3c10bcd690c4e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 02:37:39,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 02:37:39,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 02:37:39,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 02:37:39,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 02:37:39,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 02:37:39,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 02:37:39,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 02:37:39,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 02:37:39,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 02:37:39,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 02:37:39,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 02:37:39,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 02:37:39,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 02:37:39,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 02:37:39,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 02:37:39,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 02:37:39,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 02:37:39,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 02:37:39,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 02:37:39,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 02:37:39,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 02:37:39,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 02:37:39,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 02:37:39,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 02:37:39,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 02:37:39,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 02:37:39,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 02:37:39,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 02:37:39,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 02:37:39,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 02:37:39,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 02:37:39,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 02:37:39,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 02:37:39,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 02:37:39,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 02:37:39,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 02:37:39,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 02:37:39,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 02:37:39,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 02:37:39,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 02:37:39,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 02:37:39,876 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 02:37:39,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 02:37:39,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 02:37:39,877 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 02:37:39,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 02:37:39,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 02:37:39,878 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 02:37:39,878 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 02:37:39,878 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 02:37:39,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 02:37:39,879 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 02:37:39,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 02:37:39,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 02:37:39,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 02:37:39,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 02:37:39,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 02:37:39,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 02:37:39,888 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 02:37:39,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 02:37:39,889 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 02:37:39,889 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 02:37:39,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 02:37:39,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 02:37:39,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 02:37:39,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 02:37:39,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 02:37:39,890 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 02:37:39,891 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 02:37:39,891 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78f95c70d702e3726c098ef8eec3c10bcd690c4e [2021-08-31 02:37:40,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 02:37:40,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 02:37:40,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 02:37:40,150 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 02:37:40,160 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 02:37:40,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-31 02:37:40,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d937195d7/a3049a34f9184fd799b39203da9dc7ad/FLAGb80a9f488 [2021-08-31 02:37:40,568 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 02:37:40,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-08-31 02:37:40,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d937195d7/a3049a34f9184fd799b39203da9dc7ad/FLAGb80a9f488 [2021-08-31 02:37:40,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d937195d7/a3049a34f9184fd799b39203da9dc7ad [2021-08-31 02:37:40,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 02:37:40,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 02:37:40,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 02:37:40,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 02:37:40,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 02:37:40,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7c2dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40, skipping insertion in model container [2021-08-31 02:37:40,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 02:37:40,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 02:37:40,720 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-31 02:37:40,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:37:40,755 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 02:37:40,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-08-31 02:37:40,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 02:37:40,799 INFO L208 MainTranslator]: Completed translation [2021-08-31 02:37:40,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40 WrapperNode [2021-08-31 02:37:40,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 02:37:40,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 02:37:40,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 02:37:40,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 02:37:40,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 02:37:40,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 02:37:40,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 02:37:40,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 02:37:40,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 02:37:40,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 02:37:40,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 02:37:40,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 02:37:40,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (1/1) ... [2021-08-31 02:37:40,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:40,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:40,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 02:37:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-31 02:37:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-31 02:37:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 02:37:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-31 02:37:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 02:37:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 02:37:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 02:37:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 02:37:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 02:37:41,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 02:37:41,200 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-31 02:37:41,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:37:41 BoogieIcfgContainer [2021-08-31 02:37:41,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 02:37:41,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 02:37:41,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 02:37:41,208 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 02:37:41,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:37:41,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 02:37:40" (1/3) ... [2021-08-31 02:37:41,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4bff0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:37:41, skipping insertion in model container [2021-08-31 02:37:41,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:37:41,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 02:37:40" (2/3) ... [2021-08-31 02:37:41,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4bff0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 02:37:41, skipping insertion in model container [2021-08-31 02:37:41,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 02:37:41,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 02:37:41" (3/3) ... [2021-08-31 02:37:41,211 INFO L389 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2021-08-31 02:37:41,251 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 02:37:41,251 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 02:37:41,251 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 02:37:41,252 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 02:37:41,252 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 02:37:41,252 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 02:37:41,252 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 02:37:41,252 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 02:37:41,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:41,279 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2021-08-31 02:37:41,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:41,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:41,283 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:37:41,283 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 02:37:41,283 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 02:37:41,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:41,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2021-08-31 02:37:41,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:41,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:41,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 02:37:41,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 02:37:41,292 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 7#L-1true havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 34#L19-3true [2021-08-31 02:37:41,292 INFO L793 eck$LassoCheckResult]: Loop: 34#L19-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 3#L19-2true init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 34#L19-3true [2021-08-31 02:37:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 02:37:41,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:41,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810501949] [2021-08-31 02:37:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:41,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,393 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-31 02:37:41,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:41,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98819439] [2021-08-31 02:37:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:41,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,470 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,481 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-31 02:37:41,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:41,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48180666] [2021-08-31 02:37:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:41,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,523 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:41,564 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:42,301 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:37:42,301 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:37:42,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:37:42,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:37:42,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 02:37:42,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:42,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:37:42,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:37:42,302 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2021-08-31 02:37:42,302 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:37:42,303 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:37:42,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:42,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:37:43,014 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:37:43,018 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 02:37:43,019 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 02:37:43,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 02:37:43,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 02:37:43,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,144 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 02:37:43,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,187 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 02:37:43,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 02:37:43,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,279 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 02:37:43,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 02:37:43,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,377 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 02:37:43,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,425 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-31 02:37:43,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 02:37:43,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 02:37:43,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 02:37:43,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 02:37:43,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 02:37:43,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:43,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:43,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:43,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,697 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,697 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 02:37:43,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,728 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,728 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 02:37:43,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,769 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,770 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-31 02:37:43,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,813 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,814 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 02:37:43,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,857 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,858 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 02:37:43,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,902 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,903 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 02:37:43,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:43,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,945 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 02:37:43,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:43,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:43,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:43,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:43,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:43,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:43,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:43,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:43,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-31 02:37:43,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:43,999 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:43,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 02:37:44,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,040 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 02:37:44,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:44,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:44,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:44,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,066 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-31 02:37:44,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,096 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-31 02:37:44,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:44,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:44,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:44,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,124 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-31 02:37:44,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,160 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-31 02:37:44,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,201 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,201 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 02:37:44,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:37:44,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:37:44,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:37:44,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,240 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,241 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 02:37:44,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,285 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,286 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-31 02:37:44,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,351 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-31 02:37:44,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:37:44,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,411 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,424 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-31 02:37:44,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:37:44,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:37:44,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:37:44,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:37:44,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:37:44,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:37:44,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:37:44,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 02:37:44,528 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-31 02:37:44,529 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-08-31 02:37:44,530 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:37:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:44,531 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:37:44,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-31 02:37:44,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 02:37:44,583 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 02:37:44,583 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 02:37:44,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0 Supporting invariants [] [2021-08-31 02:37:44,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-31 02:37:44,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-08-31 02:37:44,673 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2021-08-31 02:37:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:44,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:37:44,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:37:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:44,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 02:37:44,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:37:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:44,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 02:37:44,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:44,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 93 states and 136 transitions. Complement of second has 7 states. [2021-08-31 02:37:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 02:37:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2021-08-31 02:37:44,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-31 02:37:44,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:37:44,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 02:37:44,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:37:44,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-31 02:37:44,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:37:44,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2021-08-31 02:37:44,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:44,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2021-08-31 02:37:44,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 02:37:44,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-31 02:37:44,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-08-31 02:37:44,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:37:44,882 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 02:37:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-08-31 02:37:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-31 02:37:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-08-31 02:37:44,898 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 02:37:44,898 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-08-31 02:37:44,898 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 02:37:44,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2021-08-31 02:37:44,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:44,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:44,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:44,900 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:37:44,900 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:37:44,900 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 264#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 265#L19-3 assume !(init_~i~0 < 2); 281#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 273#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 267#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 262#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 263#L27-3 [2021-08-31 02:37:44,900 INFO L793 eck$LassoCheckResult]: Loop: 263#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 284#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 266#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 263#L27-3 [2021-08-31 02:37:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2021-08-31 02:37:44,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:44,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687724381] [2021-08-31 02:37:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:44,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:44,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:37:44,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687724381] [2021-08-31 02:37:44,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687724381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:37:44,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:37:44,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:37:44,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537935828] [2021-08-31 02:37:44,929 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:37:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2021-08-31 02:37:44,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:44,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86260757] [2021-08-31 02:37:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:44,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:44,933 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:44,936 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:44,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:37:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:37:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:37:44,973 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:37:45,023 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-08-31 02:37:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:37:45,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2021-08-31 02:37:45,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:45,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2021-08-31 02:37:45,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-31 02:37:45,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-31 02:37:45,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-08-31 02:37:45,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:37:45,026 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-08-31 02:37:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-08-31 02:37:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-08-31 02:37:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-08-31 02:37:45,028 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-31 02:37:45,028 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-31 02:37:45,028 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 02:37:45,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2021-08-31 02:37:45,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:45,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:45,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:45,029 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:37:45,029 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:37:45,029 INFO L791 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 327#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 328#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 320#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 321#L19-3 assume !(init_~i~0 < 2); 344#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 333#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 330#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 322#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 323#L27-3 [2021-08-31 02:37:45,029 INFO L793 eck$LassoCheckResult]: Loop: 323#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 329#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 323#L27-3 [2021-08-31 02:37:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2021-08-31 02:37:45,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:45,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788764635] [2021-08-31 02:37:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:45,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:37:45,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788764635] [2021-08-31 02:37:45,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788764635] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:37:45,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252402421] [2021-08-31 02:37:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,050 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:37:45,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:45,051 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:37:45,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-31 02:37:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:45,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 02:37:45,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:37:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:45,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:37:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:45,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252402421] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 02:37:45,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 02:37:45,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-08-31 02:37:45,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81354509] [2021-08-31 02:37:45,128 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:37:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2021-08-31 02:37:45,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:45,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688549590] [2021-08-31 02:37:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,131 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:45,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:37:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 02:37:45,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-31 02:37:45,177 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:37:45,242 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-08-31 02:37:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 02:37:45,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-08-31 02:37:45,243 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:45,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-08-31 02:37:45,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-31 02:37:45,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-31 02:37:45,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-08-31 02:37:45,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:37:45,245 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-31 02:37:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-08-31 02:37:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-31 02:37:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-08-31 02:37:45,246 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-31 02:37:45,247 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-08-31 02:37:45,247 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 02:37:45,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2021-08-31 02:37:45,247 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2021-08-31 02:37:45,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:45,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:45,248 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:37:45,248 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:37:45,248 INFO L791 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 441#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 442#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 434#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 435#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 462#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 463#L19-3 assume !(init_~i~0 < 2); 458#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 447#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 444#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 436#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 437#L27-3 [2021-08-31 02:37:45,248 INFO L793 eck$LassoCheckResult]: Loop: 437#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 461#L28 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 443#L27-2 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 437#L27-3 [2021-08-31 02:37:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2021-08-31 02:37:45,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:45,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985442663] [2021-08-31 02:37:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,263 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2021-08-31 02:37:45,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:45,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47593400] [2021-08-31 02:37:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,282 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:45,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:45,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2021-08-31 02:37:45,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:45,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725549050] [2021-08-31 02:37:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:45,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:37:45,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725549050] [2021-08-31 02:37:45,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725549050] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:37:45,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647588181] [2021-08-31 02:37:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:45,455 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:37:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:37:45,456 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:37:45,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-31 02:37:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:37:45,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-31 02:37:45,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:37:45,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 309 [2021-08-31 02:37:45,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-08-31 02:37:45,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-08-31 02:37:45,656 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-31 02:37:45,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 116 treesize of output 83 [2021-08-31 02:37:45,674 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-31 02:37:45,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 80 treesize of output 47 [2021-08-31 02:37:46,094 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-31 02:37:46,094 INFO L388 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 60 treesize of output 44 [2021-08-31 02:37:46,099 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-31 02:37:46,099 INFO L388 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 38 treesize of output 22 [2021-08-31 02:37:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:37:46,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:37:58,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_init_~i~0_115 Int)) (or (< v_ULTIMATE.start_init_~i~0_115 (+ c_ULTIMATE.start_init_~i~0 1)) (and (forall ((v_DerPreprocessor_3 Int)) (= (select (select (let ((.cse1 (* v_ULTIMATE.start_init_~i~0_115 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) 0)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_3)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_DerPreprocessor_4 Int)) (= (select (select (let ((.cse3 (* v_ULTIMATE.start_init_~i~0_115 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse3 |c_~#pp~0.offset|) 0)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse3) v_DerPreprocessor_4)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) is different from false [2021-08-31 02:37:58,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-31 02:37:58,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-31 02:37:58,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-31 02:37:58,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976430295] [2021-08-31 02:37:58,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:37:58,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 02:37:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=183, Unknown=2, NotChecked=28, Total=272 [2021-08-31 02:37:58,363 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:37:58,526 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-08-31 02:37:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 02:37:58,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2021-08-31 02:37:58,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-31 02:37:58,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2021-08-31 02:37:58,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-08-31 02:37:58,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-08-31 02:37:58,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-08-31 02:37:58,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:37:58,529 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-31 02:37:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-08-31 02:37:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-08-31 02:37:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:37:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-08-31 02:37:58,530 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-31 02:37:58,530 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-08-31 02:37:58,530 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 02:37:58,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2021-08-31 02:37:58,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-31 02:37:58,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:37:58,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:37:58,533 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:37:58,533 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:37:58,533 INFO L791 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 602#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 603#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 595#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 596#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 622#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 623#L19-3 assume !(init_~i~0 < 2); 619#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 610#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 606#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 600#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 601#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 621#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 616#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 615#L27-7 [2021-08-31 02:37:58,533 INFO L793 eck$LassoCheckResult]: Loop: 615#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 607#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 609#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 615#L27-7 [2021-08-31 02:37:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2021-08-31 02:37:58,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:58,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601565454] [2021-08-31 02:37:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:58,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,565 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:58,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2021-08-31 02:37:58,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:58,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44644889] [2021-08-31 02:37:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:58,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,626 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:37:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:37:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2021-08-31 02:37:58,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:37:58,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210654519] [2021-08-31 02:37:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:37:58,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:37:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,664 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:37:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:37:58,703 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:17,925 WARN L210 SmtUtils]: Spent 19.18s on a formula simplification. DAG size of input: 318 DAG size of output: 263 [2021-08-31 02:38:24,400 WARN L210 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 199 [2021-08-31 02:38:24,403 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 02:38:24,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 02:38:24,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 02:38:24,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 02:38:24,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 02:38:24,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:24,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 02:38:24,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 02:38:24,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2021-08-31 02:38:24,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 02:38:24,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 02:38:24,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:24,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 02:38:28,667 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 02:38:28,667 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 02:38:28,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,673 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-31 02:38:28,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:28,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:28,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:28,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:28,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,748 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-31 02:38:28,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:28,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:28,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-31 02:38:28,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,806 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-31 02:38:28,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:28,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:28,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:28,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-31 02:38:28,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,833 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-31 02:38:28,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:28,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:28,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:28,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,876 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-31 02:38:28,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:28,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:28,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:28,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:28,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,917 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-31 02:38:28,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:28,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:28,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:28,960 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,970 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-31 02:38:28,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:28,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:28,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:28,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:28,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:28,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:28,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:28,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:28,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:28,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:28,996 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:28,997 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:28,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-31 02:38:28,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,056 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-31 02:38:29,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,097 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-31 02:38:29,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,122 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,123 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-31 02:38:29,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,178 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,179 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-08-31 02:38:29,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,209 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,210 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-08-31 02:38:29,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,248 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,249 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-08-31 02:38:29,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,288 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-08-31 02:38:29,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,325 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-08-31 02:38:29,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 02:38:29,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 02:38:29,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 02:38:29,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,365 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-08-31 02:38:29,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,396 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,396 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-08-31 02:38:29,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,432 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,433 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-08-31 02:38:29,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,471 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-08-31 02:38:29,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 02:38:29,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,512 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-08-31 02:38:29,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 02:38:29,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 02:38:29,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 02:38:29,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 02:38:29,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 02:38:29,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 02:38:29,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 02:38:29,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 02:38:29,586 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-08-31 02:38:29,586 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-08-31 02:38:29,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 02:38:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:29,587 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 02:38:29,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-08-31 02:38:29,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 02:38:29,610 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 02:38:29,610 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 02:38:29,610 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2021-08-31 02:38:29,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-08-31 02:38:29,813 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2021-08-31 02:38:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:29,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 02:38:29,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:29,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:38:29,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:38:29,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 02:38:29,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:29,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 88 transitions. Complement of second has 6 states. [2021-08-31 02:38:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 02:38:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-08-31 02:38:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-31 02:38:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:38:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2021-08-31 02:38:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:38:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2021-08-31 02:38:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 02:38:29,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2021-08-31 02:38:29,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-31 02:38:29,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2021-08-31 02:38:29,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-08-31 02:38:29,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-31 02:38:29,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2021-08-31 02:38:29,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:29,966 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-08-31 02:38:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2021-08-31 02:38:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-08-31 02:38:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-08-31 02:38:29,969 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-31 02:38:29,969 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-31 02:38:29,969 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 02:38:29,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-08-31 02:38:29,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 02:38:29,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:29,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:29,969 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:29,969 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:38:29,970 INFO L791 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1001#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1002#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 994#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 995#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1023#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1024#L19-3 assume !(init_~i~0 < 2); 1020#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1006#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1005#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 996#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 997#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1022#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1016#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1017#L27-7 assume !(f_~i~1 < 2); 1008#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 998#L38-3 [2021-08-31 02:38:29,970 INFO L793 eck$LassoCheckResult]: Loop: 998#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1000#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1012#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 998#L38-3 [2021-08-31 02:38:29,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:29,970 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2021-08-31 02:38:29,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:29,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37032136] [2021-08-31 02:38:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:29,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:29,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:29,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37032136] [2021-08-31 02:38:29,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37032136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:38:29,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:38:29,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 02:38:29,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065783968] [2021-08-31 02:38:29,990 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:38:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2021-08-31 02:38:29,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:29,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974714981] [2021-08-31 02:38:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:29,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:29,992 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:29,994 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:30,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:38:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 02:38:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 02:38:30,029 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:38:30,078 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-08-31 02:38:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 02:38:30,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-31 02:38:30,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-08-31 02:38:30,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-31 02:38:30,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-08-31 02:38:30,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:30,080 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-08-31 02:38:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2021-08-31 02:38:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-08-31 02:38:30,081 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-31 02:38:30,081 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-08-31 02:38:30,082 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 02:38:30,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2021-08-31 02:38:30,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 02:38:30,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:30,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:30,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:30,083 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:38:30,083 INFO L791 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1084#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1085#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1077#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1078#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1106#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1107#L19-3 assume !(init_~i~0 < 2); 1102#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1089#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1086#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1079#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1080#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1105#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1099#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1100#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1090#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1091#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1081#L38-3 [2021-08-31 02:38:30,083 INFO L793 eck$LassoCheckResult]: Loop: 1081#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1083#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1095#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1081#L38-3 [2021-08-31 02:38:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2021-08-31 02:38:30,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891074250] [2021-08-31 02:38:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:30,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:30,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891074250] [2021-08-31 02:38:30,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891074250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:38:30,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 02:38:30,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-31 02:38:30,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993123273] [2021-08-31 02:38:30,253 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:38:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2021-08-31 02:38:30,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8935036] [2021-08-31 02:38:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,255 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,257 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:30,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:38:30,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-31 02:38:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-31 02:38:30,297 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:38:30,487 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-08-31 02:38:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-31 02:38:30,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2021-08-31 02:38:30,489 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-31 02:38:30,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2021-08-31 02:38:30,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-31 02:38:30,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-31 02:38:30,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2021-08-31 02:38:30,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:30,489 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-08-31 02:38:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2021-08-31 02:38:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-08-31 02:38:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2021-08-31 02:38:30,491 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-08-31 02:38:30,491 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2021-08-31 02:38:30,491 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 02:38:30,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2021-08-31 02:38:30,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 02:38:30,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:30,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:30,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:30,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:38:30,492 INFO L791 eck$LassoCheckResult]: Stem: 1196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1183#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1184#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1176#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1177#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1205#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1206#L19-3 assume !(init_~i~0 < 2); 1202#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1188#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1187#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1181#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1182#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1204#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1198#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1199#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1191#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1192#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1197#L27-7 assume !(f_~i~1 < 2); 1190#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1178#L38-3 [2021-08-31 02:38:30,492 INFO L793 eck$LassoCheckResult]: Loop: 1178#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1180#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1194#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1178#L38-3 [2021-08-31 02:38:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2021-08-31 02:38:30,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673582981] [2021-08-31 02:38:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:30,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:30,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673582981] [2021-08-31 02:38:30,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673582981] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:38:30,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732286035] [2021-08-31 02:38:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:38:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:30,515 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:38:30,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-08-31 02:38:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:30,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 02:38:30,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:30,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:38:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:30,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732286035] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 02:38:30,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 02:38:30,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-08-31 02:38:30,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124149907] [2021-08-31 02:38:30,625 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:38:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2021-08-31 02:38:30,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040938183] [2021-08-31 02:38:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,628 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:30,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:38:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 02:38:30,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-31 02:38:30,666 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:38:30,730 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2021-08-31 02:38:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 02:38:30,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-31 02:38:30,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2021-08-31 02:38:30,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2021-08-31 02:38:30,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2021-08-31 02:38:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:30,731 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-08-31 02:38:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-08-31 02:38:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-08-31 02:38:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-08-31 02:38:30,733 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-31 02:38:30,733 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-08-31 02:38:30,733 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 02:38:30,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2021-08-31 02:38:30,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 02:38:30,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:30,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:30,734 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:30,734 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:38:30,734 INFO L791 eck$LassoCheckResult]: Stem: 1389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1376#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1377#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1369#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1370#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1399#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1400#L19-3 assume !(init_~i~0 < 2); 1395#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1381#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1380#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1374#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1375#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1397#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1391#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1392#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1384#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1385#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1390#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1382#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1383#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1371#L38-3 [2021-08-31 02:38:30,734 INFO L793 eck$LassoCheckResult]: Loop: 1371#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1373#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 1387#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1371#L38-3 [2021-08-31 02:38:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2021-08-31 02:38:30,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081976119] [2021-08-31 02:38:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,749 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,766 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2021-08-31 02:38:30,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335554689] [2021-08-31 02:38:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,768 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:30,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2021-08-31 02:38:30,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:30,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116733699] [2021-08-31 02:38:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:30,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:31,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:31,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116733699] [2021-08-31 02:38:31,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116733699] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:38:31,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395943442] [2021-08-31 02:38:31,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:31,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:38:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:31,165 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:38:31,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-08-31 02:38:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:31,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-31 02:38:31,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:31,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2021-08-31 02:38:31,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2021-08-31 02:38:31,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2021-08-31 02:38:31,665 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-31 02:38:31,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 116 treesize of output 83 [2021-08-31 02:38:31,685 INFO L354 Elim1Store]: treesize reduction 126, result has 13.1 percent of original size [2021-08-31 02:38:31,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 69 treesize of output 36 [2021-08-31 02:38:31,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-08-31 02:38:31,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-08-31 02:38:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:31,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:38:43,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_83 Int)) (or (and (forall ((ULTIMATE.start_f_~pointer.base Int) (v_DerPreprocessor_20 Int)) (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_83 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.base)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_20)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.base)) (forall ((v_DerPreprocessor_19 Int) (ULTIMATE.start_f_~pointer.offset Int)) (= c_ULTIMATE.start_main_~a~0.offset (select (select (let ((.cse3 (* v_ULTIMATE.start_f_~i~1_83 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse3 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ .cse3 |c_~#pstate~0.offset|) v_DerPreprocessor_19)))) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) (< v_ULTIMATE.start_f_~i~1_83 (+ c_ULTIMATE.start_f_~i~1 1)))) is different from false [2021-08-31 02:38:56,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_83 Int)) (or (< v_ULTIMATE.start_f_~i~1_83 1) (and (forall ((ULTIMATE.start_f_~pointer.base Int) (v_DerPreprocessor_20 Int)) (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_83 4))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.base)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_20)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.base)) (forall ((v_DerPreprocessor_19 Int) (ULTIMATE.start_f_~pointer.offset Int)) (= c_ULTIMATE.start_main_~a~0.offset (select (select (let ((.cse3 (* v_ULTIMATE.start_f_~i~1_83 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse3 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ .cse3 |c_~#pstate~0.offset|) v_DerPreprocessor_19)))) |c_~#pp~0.base|) |c_~#pp~0.offset|)))))) is different from false [2021-08-31 02:38:56,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-31 02:38:56,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-31 02:38:56,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-08-31 02:38:56,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332408528] [2021-08-31 02:38:56,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:38:56,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-31 02:38:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=390, Unknown=2, NotChecked=82, Total=552 [2021-08-31 02:38:56,100 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:38:56,521 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-08-31 02:38:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-31 02:38:56,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 64 transitions. [2021-08-31 02:38:56,522 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2021-08-31 02:38:56,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 64 transitions. [2021-08-31 02:38:56,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-08-31 02:38:56,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-31 02:38:56,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 64 transitions. [2021-08-31 02:38:56,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:56,538 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-08-31 02:38:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 64 transitions. [2021-08-31 02:38:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2021-08-31 02:38:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-08-31 02:38:56,539 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-08-31 02:38:56,540 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-08-31 02:38:56,540 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 02:38:56,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2021-08-31 02:38:56,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-08-31 02:38:56,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:56,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:56,540 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:56,540 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 02:38:56,541 INFO L791 eck$LassoCheckResult]: Stem: 1612#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1600#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1601#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1594#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1595#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1627#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1628#L19-3 assume !(init_~i~0 < 2); 1621#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1605#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1602#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1596#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1597#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1624#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1614#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1615#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1608#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1609#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1613#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1625#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1616#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1598#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1599#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1611#L41 [2021-08-31 02:38:56,541 INFO L793 eck$LassoCheckResult]: Loop: 1611#L41 assume 1 == g_#t~mem12; 1622#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1619#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1620#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1631#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1611#L41 [2021-08-31 02:38:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2021-08-31 02:38:56,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:56,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076026579] [2021-08-31 02:38:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:56,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:56,559 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:56,580 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:56,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2021-08-31 02:38:56,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:56,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266967569] [2021-08-31 02:38:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:56,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:56,583 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:38:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:38:56,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:38:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2021-08-31 02:38:56,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:56,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467587965] [2021-08-31 02:38:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:56,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:56,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:56,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467587965] [2021-08-31 02:38:56,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467587965] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:38:56,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394239792] [2021-08-31 02:38:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:56,808 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:38:56,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:56,809 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:38:56,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-08-31 02:38:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:56,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-31 02:38:56,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:56,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2021-08-31 02:38:57,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-31 02:38:57,142 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-31 02:38:57,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 17 [2021-08-31 02:38:57,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-31 02:38:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:57,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:38:57,307 INFO L354 Elim1Store]: treesize reduction 44, result has 33.3 percent of original size [2021-08-31 02:38:57,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 41 [2021-08-31 02:38:57,312 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-31 02:38:57,312 INFO L388 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 59 treesize of output 59 [2021-08-31 02:38:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-31 02:38:57,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394239792] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 02:38:57,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 02:38:57,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2021-08-31 02:38:57,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156015620] [2021-08-31 02:38:57,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:38:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-31 02:38:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2021-08-31 02:38:57,653 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:38:58,298 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2021-08-31 02:38:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-31 02:38:58,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2021-08-31 02:38:58,300 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2021-08-31 02:38:58,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2021-08-31 02:38:58,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-08-31 02:38:58,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-08-31 02:38:58,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2021-08-31 02:38:58,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 02:38:58,300 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2021-08-31 02:38:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2021-08-31 02:38:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2021-08-31 02:38:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.18) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:38:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2021-08-31 02:38:58,302 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-08-31 02:38:58,302 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 59 transitions. [2021-08-31 02:38:58,302 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 02:38:58,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 59 transitions. [2021-08-31 02:38:58,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-31 02:38:58,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:38:58,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:38:58,303 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:38:58,303 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-31 02:38:58,303 INFO L791 eck$LassoCheckResult]: Stem: 1925#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1912#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1913#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1906#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1907#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1943#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 1944#L19-3 assume !(init_~i~0 < 2); 1933#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1917#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 1914#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 1908#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1909#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1938#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1927#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1928#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1920#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1921#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1926#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1942#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 1955#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 1939#L27-7 assume !(f_~i~1 < 2); 1940#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1954#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1953#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1934#L41 [2021-08-31 02:38:58,303 INFO L793 eck$LassoCheckResult]: Loop: 1934#L41 assume 1 == g_#t~mem12; 1935#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1937#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 1945#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1946#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1934#L41 [2021-08-31 02:38:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:38:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2021-08-31 02:38:58,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:38:58,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944203088] [2021-08-31 02:38:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:58,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:38:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:38:58,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:38:58,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944203088] [2021-08-31 02:38:58,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944203088] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:38:58,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619094286] [2021-08-31 02:38:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:38:58,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:38:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:38:58,473 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:38:58,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-08-31 02:38:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:38:58,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-31 02:38:58,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:38:58,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2021-08-31 02:38:58,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-31 02:38:58,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-08-31 02:38:58,672 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-08-31 02:38:58,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 120 treesize of output 87 [2021-08-31 02:38:58,691 INFO L354 Elim1Store]: treesize reduction 140, result has 13.0 percent of original size [2021-08-31 02:38:58,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 40 [2021-08-31 02:38:58,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-08-31 02:38:58,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-31 02:38:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 02:38:58,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 02:39:10,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_93 Int)) (or (and (forall ((v_DerPreprocessor_23 Int) (ULTIMATE.start_f_~pointer.offset Int)) (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_93 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_23)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0)) (forall ((ULTIMATE.start_f_~pointer.base Int) (v_DerPreprocessor_22 Int)) (= (select (select (let ((.cse3 (* v_ULTIMATE.start_f_~i~1_93 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse3) ULTIMATE.start_f_~pointer.base)))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse3) v_DerPreprocessor_22)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0))) (< 0 v_ULTIMATE.start_f_~i~1_93))) is different from false [2021-08-31 02:39:11,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-31 02:39:11,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-31 02:39:11,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-31 02:39:11,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770463446] [2021-08-31 02:39:11,043 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 02:39:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:39:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2021-08-31 02:39:11,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:39:11,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134741203] [2021-08-31 02:39:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:39:11,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:39:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,046 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:39:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:39:11,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:39:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-31 02:39:11,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=279, Unknown=1, NotChecked=34, Total=380 [2021-08-31 02:39:11,191 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:39:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:39:11,443 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-08-31 02:39:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-31 02:39:11,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2021-08-31 02:39:11,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-31 02:39:11,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2021-08-31 02:39:11,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-31 02:39:11,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-08-31 02:39:11,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2021-08-31 02:39:11,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:39:11,444 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-31 02:39:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2021-08-31 02:39:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-08-31 02:39:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:39:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-08-31 02:39:11,446 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-31 02:39:11,446 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-31 02:39:11,446 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 02:39:11,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2021-08-31 02:39:11,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-31 02:39:11,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 02:39:11,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 02:39:11,446 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 02:39:11,446 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 02:39:11,447 INFO L791 eck$LassoCheckResult]: Stem: 2172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 2161#L-1 havoc main_#res;havoc main_#t~ret14.base, main_#t~ret14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post7, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 2162#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 2155#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 2156#L19-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 2186#L19-2 init_#t~post7 := init_~i~0;init_~i~0 := 1 + init_#t~post7;havoc init_#t~post7; 2187#L19-3 assume !(init_~i~0 < 2); 2181#L17 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 2166#L49 main_#t~ret14.base, main_#t~ret14.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret14.base, main_#t~ret14.offset;havoc main_#t~ret14.base, main_#t~ret14.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post13, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post13 := ~counter~0;~counter~0 := 1 + malloc_#t~post13;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post13;havoc malloc_#t~post13; 2163#L49-1 main_#t~ret15.base, main_#t~ret15.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc main_#t~ret15.base, main_#t~ret15.offset; 2157#L59 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2158#L27-3 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 2185#L28 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 2174#L25 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem9.base, f_#t~mem9.offset, f_#t~post8, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 2175#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 2167#L28-1 assume !(f_#t~mem9.base == 0 && f_#t~mem9.offset == 0);havoc f_#t~mem9.base, f_#t~mem9.offset; 2168#L27-6 f_#t~post8 := f_~i~1;f_~i~1 := 1 + f_#t~post8;havoc f_#t~post8; 2173#L27-7 assume !!(f_~i~1 < 2);call f_#t~mem9.base, f_#t~mem9.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 2189#L28-1 assume f_#t~mem9.base == 0 && f_#t~mem9.offset == 0;havoc f_#t~mem9.base, f_#t~mem9.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 2176#L25-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem11.base, g_#t~mem11.offset, g_#t~mem12, g_#t~post10, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 2159#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 2160#L39 assume g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset;havoc g_#t~mem11.base, g_#t~mem11.offset;call g_#t~mem12 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 2182#L41 assume 1 == g_#t~mem12; 2183#L6 havoc g_#t~mem12;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 2179#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 2180#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 2170#L39 [2021-08-31 02:39:11,447 INFO L793 eck$LassoCheckResult]: Loop: 2170#L39 assume !(g_#t~mem11.base == g_~pointer.base && g_#t~mem11.offset == g_~pointer.offset);havoc g_#t~mem11.base, g_#t~mem11.offset; 2171#L38-2 g_#t~post10 := g_~i~2;g_~i~2 := 1 + g_#t~post10;havoc g_#t~post10; 2188#L38-3 assume !!(g_~i~2 < 2);call g_#t~mem11.base, g_#t~mem11.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 2170#L39 [2021-08-31 02:39:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:39:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2021-08-31 02:39:11,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:39:11,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102529844] [2021-08-31 02:39:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:39:11,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:39:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,471 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:39:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,497 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:39:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:39:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2021-08-31 02:39:11,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:39:11,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827462702] [2021-08-31 02:39:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:39:11,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:39:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,499 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 02:39:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 02:39:11,500 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 02:39:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 02:39:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2021-08-31 02:39:11,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 02:39:11,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841042402] [2021-08-31 02:39:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:39:11,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 02:39:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:39:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-31 02:39:11,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 02:39:11,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841042402] [2021-08-31 02:39:11,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841042402] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 02:39:11,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123559839] [2021-08-31 02:39:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 02:39:11,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 02:39:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 02:39:11,561 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 02:39:11,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-08-31 02:39:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 02:39:11,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 02:39:11,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 02:39:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-31 02:39:11,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 02:39:11,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123559839] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 02:39:11,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 02:39:11,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-08-31 02:39:11,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077549600] [2021-08-31 02:39:11,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 02:39:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 02:39:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-31 02:39:11,708 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 02:39:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 02:39:11,776 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-08-31 02:39:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 02:39:11,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2021-08-31 02:39:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 02:39:11,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 02:39:11,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 02:39:11,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 02:39:11,777 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 02:39:11,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 02:39:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 02:39:11,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 02:39:11,779 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 02:39:11,780 INFO L158 Benchmark]: Toolchain (without parser) took 91188.21ms. Allocated memory was 56.6MB in the beginning and 130.0MB in the end (delta: 73.4MB). Free memory was 36.1MB in the beginning and 95.6MB in the end (delta: -59.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2021-08-31 02:39:11,780 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.3MB in the end (delta: 39.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:39:11,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.11ms. Allocated memory is still 56.6MB. Free memory was 35.9MB in the beginning and 40.7MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 02:39:11,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.25ms. Allocated memory is still 56.6MB. Free memory was 40.7MB in the beginning and 38.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 02:39:11,781 INFO L158 Benchmark]: Boogie Preprocessor took 35.32ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 02:39:11,781 INFO L158 Benchmark]: RCFGBuilder took 319.14ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 37.3MB in the beginning and 60.9MB in the end (delta: -23.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2021-08-31 02:39:11,781 INFO L158 Benchmark]: BuchiAutomizer took 90574.57ms. Allocated memory was 79.7MB in the beginning and 130.0MB in the end (delta: 50.3MB). Free memory was 60.7MB in the beginning and 95.6MB in the end (delta: -34.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2021-08-31 02:39:11,782 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.3MB in the end (delta: 39.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.11ms. Allocated memory is still 56.6MB. Free memory was 35.9MB in the beginning and 40.7MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.25ms. Allocated memory is still 56.6MB. Free memory was 40.7MB in the beginning and 38.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.32ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.14ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 37.3MB in the beginning and 60.9MB in the end (delta: -23.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 90574.57ms. Allocated memory was 79.7MB in the beginning and 130.0MB in the end (delta: 50.3MB). Free memory was 60.7MB in the beginning and 95.6MB in the end (delta: -34.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 * unknown-#length-unknown[pp] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * i and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 28 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 02:39:11,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:12,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:12,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:12,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:12,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:12,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:13,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-08-31 02:39:13,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...