./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:26:04,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:26:04,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:26:04,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:26:04,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:26:04,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:26:04,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:26:04,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:26:04,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:26:04,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:26:04,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:26:04,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:26:04,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:26:04,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:26:04,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:26:04,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:26:04,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:26:04,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:26:04,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:26:04,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:26:04,885 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:26:04,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:26:04,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:26:04,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:26:04,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:26:04,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:26:04,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:26:04,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:26:04,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:26:04,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:26:04,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:26:04,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:26:04,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:26:04,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:26:04,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:26:04,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:26:04,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:26:04,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:26:04,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:26:04,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:26:04,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:26:04,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:26:04,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:26:04,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:26:04,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:26:04,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:26:04,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:26:04,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:26:04,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:26:04,922 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:26:04,923 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:26:04,923 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:26:04,923 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:26:04,923 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:26:04,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:26:04,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:26:04,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:26:04,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:26:04,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:26:04,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:26:04,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:26:04,926 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2e8c7278f9710711a8ba5cefeb9f745a5377c275c5c72390d2d78403afcf1c7 [2022-07-23 14:26:05,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:26:05,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:26:05,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:26:05,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:26:05,109 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:26:05,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-07-23 14:26:05,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014a54ac1/1bfdd301de0b445fbe1a562abeeb027f/FLAGc5aca3daf [2022-07-23 14:26:05,546 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:26:05,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca.i [2022-07-23 14:26:05,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014a54ac1/1bfdd301de0b445fbe1a562abeeb027f/FLAGc5aca3daf [2022-07-23 14:26:05,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014a54ac1/1bfdd301de0b445fbe1a562abeeb027f [2022-07-23 14:26:05,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:26:05,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:26:05,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:26:05,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:26:05,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:26:05,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e64941e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05, skipping insertion in model container [2022-07-23 14:26:05,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:26:05,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:26:05,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:26:05,835 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:26:05,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:26:05,901 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:26:05,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05 WrapperNode [2022-07-23 14:26:05,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:26:05,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:26:05,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:26:05,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:26:05,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,936 INFO L137 Inliner]: procedures = 110, calls = 67, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-07-23 14:26:05,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:26:05,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:26:05,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:26:05,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:26:05,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:26:05,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:26:05,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:26:05,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:26:05,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (1/1) ... [2022-07-23 14:26:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:05,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:05,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:06,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:26:06,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:26:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:26:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:26:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:26:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:26:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:26:06,094 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:26:06,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:26:06,314 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:26:06,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:26:06,323 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 14:26:06,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:06 BoogieIcfgContainer [2022-07-23 14:26:06,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:26:06,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:26:06,325 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:26:06,332 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:26:06,333 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:06,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:26:05" (1/3) ... [2022-07-23 14:26:06,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ee86603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:26:06, skipping insertion in model container [2022-07-23 14:26:06,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:06,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:05" (2/3) ... [2022-07-23 14:26:06,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ee86603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:26:06, skipping insertion in model container [2022-07-23 14:26:06,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:06,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:06" (3/3) ... [2022-07-23 14:26:06,335 INFO L354 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca.i [2022-07-23 14:26:06,378 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:26:06,378 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:26:06,378 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:26:06,378 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:26:06,379 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:26:06,379 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:26:06,379 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:26:06,379 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:26:06,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) [2022-07-23 14:26:06,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:06,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:06,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:06,399 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:06,399 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:06,400 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:26:06,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) [2022-07-23 14:26:06,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:06,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:06,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:06,402 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:06,402 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:06,406 INFO L752 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 9#L553true assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 3#L553-2true call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 22#L558true assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 18#L558-2true call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 23#L563true assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 19#L563-2true call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 26#L568true assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 25#L568-2true call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 14#L573true assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 7#L573-2true call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 11#L578true assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 15#L578-2true call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 20#L583true assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 24#L583-2true call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 17#L588true assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 6#L588-2true call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 8#L593true assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 16#L598-4true [2022-07-23 14:26:06,407 INFO L754 eck$LassoCheckResult]: Loop: 16#L598-4true call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 12#L598true assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 21#L598-2true assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 16#L598-4true [2022-07-23 14:26:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 187436106, now seen corresponding path program 1 times [2022-07-23 14:26:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:06,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901469138] [2022-07-23 14:26:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:06,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901469138] [2022-07-23 14:26:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901469138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:06,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:06,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 14:26:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123901946] [2022-07-23 14:26:06,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:06,808 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 1 times [2022-07-23 14:26:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:06,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336859133] [2022-07-23 14:26:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:06,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:06,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:26:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:26:07,089 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 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) Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:07,396 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-07-23 14:26:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:26:07,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2022-07-23 14:26:07,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:07,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 66 states and 92 transitions. [2022-07-23 14:26:07,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-23 14:26:07,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-23 14:26:07,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-07-23 14:26:07,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:07,415 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-07-23 14:26:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-07-23 14:26:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2022-07-23 14:26:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-07-23 14:26:07,432 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-07-23 14:26:07,432 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-07-23 14:26:07,432 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:26:07,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2022-07-23 14:26:07,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:07,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:07,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:07,435 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:07,435 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:07,436 INFO L752 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 146#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 151#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 155#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 144#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 145#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 147#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 148#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 162#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 134#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 135#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 150#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 136#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 137#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 153#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 142#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 143#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 149#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 138#L598-4 [2022-07-23 14:26:07,436 INFO L754 eck$LassoCheckResult]: Loop: 138#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 139#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 154#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 138#L598-4 [2022-07-23 14:26:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1775784008, now seen corresponding path program 1 times [2022-07-23 14:26:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:07,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438178430] [2022-07-23 14:26:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438178430] [2022-07-23 14:26:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438178430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:07,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:07,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:26:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868980058] [2022-07-23 14:26:07,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:07,475 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 2 times [2022-07-23 14:26:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:07,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751207345] [2022-07-23 14:26:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:07,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:07,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:26:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:26:07,663 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:07,700 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-07-23 14:26:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:26:07,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2022-07-23 14:26:07,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:07,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 45 transitions. [2022-07-23 14:26:07,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-07-23 14:26:07,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-23 14:26:07,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2022-07-23 14:26:07,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:07,703 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-23 14:26:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2022-07-23 14:26:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-23 14:26:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 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) [2022-07-23 14:26:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-07-23 14:26:07,704 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-23 14:26:07,704 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-07-23 14:26:07,705 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:26:07,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-07-23 14:26:07,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:07,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:07,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:07,706 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:07,706 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:07,706 INFO L752 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 224#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 229#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 242#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 241#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 240#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 238#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 236#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 237#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 239#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 212#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 235#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 232#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 234#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 230#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 218#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 219#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 227#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 216#L598-4 [2022-07-23 14:26:07,706 INFO L754 eck$LassoCheckResult]: Loop: 216#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 217#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 231#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 216#L598-4 [2022-07-23 14:26:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1239319610, now seen corresponding path program 1 times [2022-07-23 14:26:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780431129] [2022-07-23 14:26:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:07,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780431129] [2022-07-23 14:26:07,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780431129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:07,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:07,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 14:26:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207193603] [2022-07-23 14:26:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:07,809 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 3 times [2022-07-23 14:26:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:07,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654328984] [2022-07-23 14:26:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:07,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:07,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 14:26:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 14:26:08,028 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 12 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:08,143 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-07-23 14:26:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:26:08,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2022-07-23 14:26:08,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2022-07-23 14:26:08,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-07-23 14:26:08,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-23 14:26:08,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2022-07-23 14:26:08,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:08,146 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-07-23 14:26:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2022-07-23 14:26:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-23 14:26:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-23 14:26:08,148 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-23 14:26:08,148 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-23 14:26:08,148 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:26:08,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2022-07-23 14:26:08,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:08,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:08,149 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:08,149 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:08,149 INFO L752 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 318#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 312#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 313#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 334#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 332#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 319#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 320#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 330#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 306#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 307#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 322#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 328#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 331#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 324#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 314#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 315#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 321#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 310#L598-4 [2022-07-23 14:26:08,150 INFO L754 eck$LassoCheckResult]: Loop: 310#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 311#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 325#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 310#L598-4 [2022-07-23 14:26:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -652513596, now seen corresponding path program 1 times [2022-07-23 14:26:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276243272] [2022-07-23 14:26:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:08,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276243272] [2022-07-23 14:26:08,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276243272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:08,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:08,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 14:26:08,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156536532] [2022-07-23 14:26:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:08,233 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 4 times [2022-07-23 14:26:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280762091] [2022-07-23 14:26:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:08,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 14:26:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-23 14:26:08,402 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:08,505 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-07-23 14:26:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:26:08,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-07-23 14:26:08,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-07-23 14:26:08,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-23 14:26:08,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-23 14:26:08,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-07-23 14:26:08,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:08,508 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-07-23 14:26:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-07-23 14:26:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-07-23 14:26:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-07-23 14:26:08,513 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-23 14:26:08,513 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-07-23 14:26:08,513 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:26:08,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-07-23 14:26:08,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:08,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:08,515 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:08,515 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:08,516 INFO L752 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 410#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 406#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 418#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 420#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 411#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 412#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 426#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 425#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 400#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 424#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 419#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 423#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 417#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 404#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 405#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 413#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 397#L598-4 [2022-07-23 14:26:08,516 INFO L754 eck$LassoCheckResult]: Loop: 397#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 398#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 416#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 397#L598-4 [2022-07-23 14:26:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1353578174, now seen corresponding path program 1 times [2022-07-23 14:26:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676055841] [2022-07-23 14:26:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:08,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:08,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676055841] [2022-07-23 14:26:08,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676055841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:08,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:08,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:26:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207669945] [2022-07-23 14:26:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:08,582 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 5 times [2022-07-23 14:26:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091042510] [2022-07-23 14:26:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:26:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:26:08,774 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:08,859 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-23 14:26:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:26:08,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-07-23 14:26:08,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-07-23 14:26:08,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-23 14:26:08,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-23 14:26:08,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-07-23 14:26:08,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:08,861 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-07-23 14:26:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-07-23 14:26:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-07-23 14:26:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-23 14:26:08,863 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-23 14:26:08,863 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-23 14:26:08,863 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:26:08,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-07-23 14:26:08,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:08,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:08,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:08,864 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:08,864 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:08,864 INFO L752 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 500#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 504#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 515#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 514#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 512#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 513#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 517#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 516#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 486#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 487#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 511#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 507#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 510#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 505#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 492#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 493#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 501#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 490#L598-4 [2022-07-23 14:26:08,864 INFO L754 eck$LassoCheckResult]: Loop: 490#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 491#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 506#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 490#L598-4 [2022-07-23 14:26:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2033636544, now seen corresponding path program 1 times [2022-07-23 14:26:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986122062] [2022-07-23 14:26:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986122062] [2022-07-23 14:26:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986122062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:08,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:08,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 14:26:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809441679] [2022-07-23 14:26:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:08,924 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 6 times [2022-07-23 14:26:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:08,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90087586] [2022-07-23 14:26:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:08,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:26:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:26:09,063 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:09,153 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-07-23 14:26:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:26:09,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 67 transitions. [2022-07-23 14:26:09,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 67 transitions. [2022-07-23 14:26:09,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-07-23 14:26:09,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-23 14:26:09,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2022-07-23 14:26:09,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:09,156 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-07-23 14:26:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2022-07-23 14:26:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-07-23 14:26:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-23 14:26:09,158 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-23 14:26:09,158 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-23 14:26:09,158 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:26:09,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2022-07-23 14:26:09,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:09,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:09,159 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:09,159 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:09,160 INFO L752 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 595#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 600#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 604#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 593#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 594#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 596#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 597#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 611#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 583#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 584#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 599#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 585#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 586#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 602#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 591#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 592#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 598#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 587#L598-4 [2022-07-23 14:26:09,160 INFO L754 eck$LassoCheckResult]: Loop: 587#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 588#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 603#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 587#L598-4 [2022-07-23 14:26:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash 486323390, now seen corresponding path program 1 times [2022-07-23 14:26:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171394789] [2022-07-23 14:26:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:09,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171394789] [2022-07-23 14:26:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171394789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:09,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 14:26:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216655421] [2022-07-23 14:26:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:09,264 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 7 times [2022-07-23 14:26:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613002900] [2022-07-23 14:26:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 14:26:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-23 14:26:09,401 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:09,492 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-23 14:26:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 14:26:09,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2022-07-23 14:26:09,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 59 transitions. [2022-07-23 14:26:09,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-07-23 14:26:09,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-07-23 14:26:09,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 59 transitions. [2022-07-23 14:26:09,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:09,494 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-07-23 14:26:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 59 transitions. [2022-07-23 14:26:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-07-23 14:26:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.2) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-07-23 14:26:09,506 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-23 14:26:09,506 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-23 14:26:09,506 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:26:09,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2022-07-23 14:26:09,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:09,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:09,507 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:09,507 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:09,507 INFO L752 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 697#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 700#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 720#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 719#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 718#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 717#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 716#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 715#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 683#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 684#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 699#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 685#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 686#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 701#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 689#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 690#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 698#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 687#L598-4 [2022-07-23 14:26:09,507 INFO L754 eck$LassoCheckResult]: Loop: 687#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 688#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 702#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 687#L598-4 [2022-07-23 14:26:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash 486321468, now seen corresponding path program 1 times [2022-07-23 14:26:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496759589] [2022-07-23 14:26:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:09,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496759589] [2022-07-23 14:26:09,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496759589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:09,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:09,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:26:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814135250] [2022-07-23 14:26:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:09,545 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 8 times [2022-07-23 14:26:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439198844] [2022-07-23 14:26:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:26:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:26:09,680 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:09,739 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-07-23 14:26:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:26:09,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2022-07-23 14:26:09,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2022-07-23 14:26:09,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-23 14:26:09,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-23 14:26:09,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-07-23 14:26:09,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:09,742 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-23 14:26:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-07-23 14:26:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-23 14:26:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-23 14:26:09,743 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-23 14:26:09,743 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-23 14:26:09,743 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:26:09,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2022-07-23 14:26:09,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:09,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:09,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:09,744 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:09,744 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:09,744 INFO L752 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 788#L553 assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1;call write~int(1, main_~x~0#1.base, main_~x~0#1.offset, 4); 782#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 783#L558 assume main_#t~mem8#1 > 0;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post10#1 := main_#t~mem9#1;call write~int(1 + main_#t~post10#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;havoc main_#t~post10#1; 786#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 787#L563 assume main_#t~mem13#1 > 0;havoc main_#t~mem13#1;call main_#t~mem14#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post15#1 := main_#t~mem14#1;call write~int(1 + main_#t~post15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~post15#1; 789#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 790#L568 assume main_#t~mem18#1 > 0;havoc main_#t~mem18#1;call main_#t~mem19#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 800#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 778#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 779#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 793#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 780#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 781#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 797#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 784#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 785#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 794#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 776#L598-4 [2022-07-23 14:26:09,745 INFO L754 eck$LassoCheckResult]: Loop: 776#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 777#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 796#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 776#L598-4 [2022-07-23 14:26:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,745 INFO L85 PathProgramCache]: Analyzing trace with hash 486321466, now seen corresponding path program 1 times [2022-07-23 14:26:09,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892312706] [2022-07-23 14:26:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 9 times [2022-07-23 14:26:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48905766] [2022-07-23 14:26:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1078171826, now seen corresponding path program 1 times [2022-07-23 14:26:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730596946] [2022-07-23 14:26:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:09,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:14,476 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:26:14,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:26:14,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:26:14,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:26:14,477 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:26:14,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:14,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:26:14,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:26:14,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration9_Lasso [2022-07-23 14:26:14,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:26:14,477 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:26:14,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:14,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:15,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:26:15,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:26:15,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 14:26:15,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:26:15,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:26:15,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 14:26:15,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-23 14:26:15,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 14:26:15,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-23 14:26:15,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 14:26:15,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 14:26:15,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-23 14:26:15,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 14:26:15,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:15,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:15,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 14:26:15,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 [2022-07-23 14:26:15,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,748 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) [2022-07-23 14:26:15,749 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 [2022-07-23 14:26:15,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,787 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 [2022-07-23 14:26:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,788 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) [2022-07-23 14:26:15,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,796 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 [2022-07-23 14:26:15,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,817 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 [2022-07-23 14:26:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,818 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) [2022-07-23 14:26:15,819 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 [2022-07-23 14:26:15,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,844 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 [2022-07-23 14:26:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,845 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:26:15,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,883 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:26:15,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,922 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 [2022-07-23 14:26:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,923 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:26:15,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,948 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:26:15,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:15,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:15,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:15,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:15,974 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:15,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:26:15,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:15,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:15,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:15,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:15,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:15,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:15,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:15,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:15,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,011 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 [2022-07-23 14:26:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:26:16,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-23 14:26:16,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,037 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:26:16,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:16,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,089 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:26:16,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,132 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 [2022-07-23 14:26:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,133 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 14:26:16,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,169 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) [2022-07-23 14:26:16,169 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 [2022-07-23 14:26:16,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-23 14:26:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,200 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) [2022-07-23 14:26:16,201 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 [2022-07-23 14:26:16,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-23 14:26:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,236 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) [2022-07-23 14:26:16,237 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 [2022-07-23 14:26:16,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-23 14:26:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,265 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) [2022-07-23 14:26:16,266 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 [2022-07-23 14:26:16,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,290 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 [2022-07-23 14:26:16,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,291 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) [2022-07-23 14:26:16,292 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 [2022-07-23 14:26:16,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,324 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 [2022-07-23 14:26:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,325 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) [2022-07-23 14:26:16,326 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 [2022-07-23 14:26:16,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-23 14:26:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,349 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) [2022-07-23 14:26:16,350 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 [2022-07-23 14:26:16,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,381 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 [2022-07-23 14:26:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,382 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) [2022-07-23 14:26:16,392 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 [2022-07-23 14:26:16,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-23 14:26:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,417 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) [2022-07-23 14:26:16,417 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 [2022-07-23 14:26:16,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-23 14:26:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,441 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) [2022-07-23 14:26:16,441 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 [2022-07-23 14:26:16,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:16,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:16,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:16,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-23 14:26:16,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,471 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) [2022-07-23 14:26:16,471 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 [2022-07-23 14:26:16,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-23 14:26:16,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,497 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) [2022-07-23 14:26:16,498 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 [2022-07-23 14:26:16,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:16,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,529 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-23 14:26:16,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-23 14:26:16,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,570 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:16,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-23 14:26:16,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,622 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) [2022-07-23 14:26:16,623 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 [2022-07-23 14:26:16,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-23 14:26:16,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,658 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) [2022-07-23 14:26:16,659 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 [2022-07-23 14:26:16,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:16,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,715 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) [2022-07-23 14:26:16,715 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 [2022-07-23 14:26:16,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,740 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 [2022-07-23 14:26:16,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,741 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) [2022-07-23 14:26:16,741 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 [2022-07-23 14:26:16,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:16,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-23 14:26:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,779 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) [2022-07-23 14:26:16,779 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 [2022-07-23 14:26:16,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:16,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:16,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:16,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:16,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:16,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:16,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:16,802 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:26:16,841 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-23 14:26:16,841 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-23 14:26:16,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:16,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:16,860 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) [2022-07-23 14:26:16,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:26:16,900 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 [2022-07-23 14:26:16,928 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 14:26:16,928 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:26:16,929 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_1 + 100 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 - 2 >= 0] [2022-07-23 14:26:16,955 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 [2022-07-23 14:26:17,050 INFO L293 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-07-23 14:26:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:17,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 14:26:17,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:17,151 INFO L390 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 14 treesize of output 12 [2022-07-23 14:26:17,213 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,251 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,289 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,329 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,367 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,416 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 [2022-07-23 14:26:17,435 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,466 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:17,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 14:26:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:17,593 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 3 loop predicates [2022-07-23 14:26:17,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:17,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 50 transitions. cyclomatic complexity: 9. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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 57 states and 69 transitions. Complement of second has 17 states. [2022-07-23 14:26:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2022-07-23 14:26:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-07-23 14:26:17,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-23 14:26:17,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:17,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-23 14:26:17,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:17,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 49 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-23 14:26:17,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:17,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2022-07-23 14:26:17,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-23 14:26:17,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 33 states and 42 transitions. [2022-07-23 14:26:17,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-23 14:26:17,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-23 14:26:17,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2022-07-23 14:26:17,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:17,829 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-07-23 14:26:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2022-07-23 14:26:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-23 14:26:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 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) [2022-07-23 14:26:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-23 14:26:17,830 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-23 14:26:17,830 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-23 14:26:17,830 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 14:26:17,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-07-23 14:26:17,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:17,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:17,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:17,831 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:17,831 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:17,831 INFO L752 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1178#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1172#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1173#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1174#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1175#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1176#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1177#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1185#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1164#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1165#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1180#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1167#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1168#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1184#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1169#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1170#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1181#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1162#L598-4 [2022-07-23 14:26:17,831 INFO L754 eck$LassoCheckResult]: Loop: 1162#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1163#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1182#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1162#L598-4 [2022-07-23 14:26:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash -492624188, now seen corresponding path program 1 times [2022-07-23 14:26:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:17,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190086405] [2022-07-23 14:26:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:17,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190086405] [2022-07-23 14:26:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190086405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:17,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:17,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:26:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926554693] [2022-07-23 14:26:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:17,866 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 10 times [2022-07-23 14:26:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:17,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861771925] [2022-07-23 14:26:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:17,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:17,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:26:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:26:18,016 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:18,078 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-23 14:26:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:26:18,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-07-23 14:26:18,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2022-07-23 14:26:18,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-23 14:26:18,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-23 14:26:18,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-07-23 14:26:18,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:18,080 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-23 14:26:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-07-23 14:26:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-23 14:26:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-23 14:26:18,081 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-23 14:26:18,081 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-23 14:26:18,081 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 14:26:18,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2022-07-23 14:26:18,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:18,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:18,082 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:18,082 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:18,082 INFO L752 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1251#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1247#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1248#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1249#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1250#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1252#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1253#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1259#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1239#L573 assume main_#t~mem23#1 > 0;havoc main_#t~mem23#1;call main_#t~mem24#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post25#1 := main_#t~mem24#1;call write~int(1 + main_#t~post25#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem24#1;havoc main_#t~post25#1; 1240#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1255#L578 assume main_#t~mem28#1 > 0;havoc main_#t~mem28#1;call main_#t~mem29#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post30#1 := main_#t~mem29#1;call write~int(1 + main_#t~post30#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem29#1;havoc main_#t~post30#1; 1262#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1261#L583 assume main_#t~mem33#1 > 0;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post35#1 := main_#t~mem34#1;call write~int(1 + main_#t~post35#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem34#1;havoc main_#t~post35#1; 1256#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1244#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1245#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1254#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1237#L598-4 [2022-07-23 14:26:18,082 INFO L754 eck$LassoCheckResult]: Loop: 1237#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1238#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1257#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1237#L598-4 [2022-07-23 14:26:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2027335746, now seen corresponding path program 1 times [2022-07-23 14:26:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891059420] [2022-07-23 14:26:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:18,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891059420] [2022-07-23 14:26:18,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891059420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:18,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:18,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:26:18,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987546638] [2022-07-23 14:26:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:18,119 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 11 times [2022-07-23 14:26:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605714281] [2022-07-23 14:26:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:26:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:26:18,260 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:18,312 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-23 14:26:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:26:18,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2022-07-23 14:26:18,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 14:26:18,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-23 14:26:18,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-23 14:26:18,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2022-07-23 14:26:18,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:18,313 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 14:26:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2022-07-23 14:26:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-07-23 14:26:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-23 14:26:18,314 INFO L392 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-23 14:26:18,314 INFO L374 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-23 14:26:18,314 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-23 14:26:18,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-07-23 14:26:18,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:18,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:18,315 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:18,315 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:18,315 INFO L752 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1315#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1311#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1312#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1313#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1314#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1316#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1317#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1323#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1302#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1303#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1319#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1304#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1305#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1321#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1308#L588 assume main_#t~mem38#1 > 0;havoc main_#t~mem38#1;call main_#t~mem39#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post40#1 := main_#t~mem39#1;call write~int(1 + main_#t~post40#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem39#1;havoc main_#t~post40#1; 1309#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1320#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1306#L598-4 [2022-07-23 14:26:18,315 INFO L754 eck$LassoCheckResult]: Loop: 1306#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1307#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1322#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1306#L598-4 [2022-07-23 14:26:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 189281224, now seen corresponding path program 1 times [2022-07-23 14:26:18,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384602001] [2022-07-23 14:26:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:18,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384602001] [2022-07-23 14:26:18,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384602001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:18,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:18,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 14:26:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439920998] [2022-07-23 14:26:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:18,427 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 12 times [2022-07-23 14:26:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195551871] [2022-07-23 14:26:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 14:26:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-07-23 14:26:18,556 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 4 Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:18,629 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-23 14:26:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 14:26:18,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2022-07-23 14:26:18,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 14:26:18,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-23 14:26:18,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-07-23 14:26:18,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2022-07-23 14:26:18,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:18,631 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 14:26:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2022-07-23 14:26:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-07-23 14:26:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 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) [2022-07-23 14:26:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-23 14:26:18,632 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-23 14:26:18,632 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-23 14:26:18,632 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-23 14:26:18,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2022-07-23 14:26:18,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:18,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:18,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:18,632 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:18,632 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:18,633 INFO L752 eck$LassoCheckResult]: Stem: 1369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1385#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1377#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1378#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1381#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1382#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1383#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1384#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1390#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1371#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1372#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1387#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1373#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1374#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1388#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1379#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1380#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1386#L593 assume !(main_#t~mem43#1 > 0);havoc main_#t~mem43#1;call main_#t~mem46#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post47#1 := main_#t~mem46#1;call write~int(main_#t~post47#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem46#1;havoc main_#t~post47#1; 1375#L598-4 [2022-07-23 14:26:18,633 INFO L754 eck$LassoCheckResult]: Loop: 1375#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1376#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1389#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1375#L598-4 [2022-07-23 14:26:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 189283148, now seen corresponding path program 1 times [2022-07-23 14:26:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741406049] [2022-07-23 14:26:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 13 times [2022-07-23 14:26:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572633688] [2022-07-23 14:26:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -357729952, now seen corresponding path program 1 times [2022-07-23 14:26:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:18,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078982927] [2022-07-23 14:26:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:18,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:23,013 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:26:23,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:26:23,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:26:23,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:26:23,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:26:23,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:23,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:26:23,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:26:23,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca.i_Iteration13_Lasso [2022-07-23 14:26:23,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:26:23,013 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:26:23,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:23,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:26:23,923 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:26:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:23,924 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) [2022-07-23 14:26:23,925 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 [2022-07-23 14:26:23,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:23,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:23,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:23,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:23,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:23,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:23,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:23,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:23,970 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 [2022-07-23 14:26:23,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:23,971 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) [2022-07-23 14:26:23,971 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 [2022-07-23 14:26:23,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:23,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:23,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:23,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:23,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:23,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:23,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:23,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-23 14:26:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:23,995 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) [2022-07-23 14:26:23,996 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 [2022-07-23 14:26:23,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,021 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 [2022-07-23 14:26:24,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,023 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) [2022-07-23 14:26:24,024 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 [2022-07-23 14:26:24,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 [2022-07-23 14:26:24,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-23 14:26:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,058 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) [2022-07-23 14:26:24,059 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 [2022-07-23 14:26:24,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-23 14:26:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,084 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) [2022-07-23 14:26:24,085 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 [2022-07-23 14:26:24,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,126 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 [2022-07-23 14:26:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,127 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) [2022-07-23 14:26:24,127 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 [2022-07-23 14:26:24,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-23 14:26:24,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,162 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) [2022-07-23 14:26:24,163 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 [2022-07-23 14:26:24,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-23 14:26:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,198 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) [2022-07-23 14:26:24,199 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 [2022-07-23 14:26:24,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:24,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-23 14:26:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,222 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) [2022-07-23 14:26:24,223 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 [2022-07-23 14:26:24,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:26:24,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:24,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:24,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:24,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:24,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:24,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:24,236 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:26:24,241 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-23 14:26:24,241 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-23 14:26:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:24,242 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) [2022-07-23 14:26:24,243 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 [2022-07-23 14:26:24,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:26:24,250 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 14:26:24,250 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:26:24,250 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0#1.base) ULTIMATE.start_main_~z~0#1.offset)_2 + 100 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 - 2 >= 0] [2022-07-23 14:26:24,264 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 [2022-07-23 14:26:24,355 INFO L293 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2022-07-23 14:26:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:24,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 14:26:24,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:24,428 INFO L390 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 14 treesize of output 12 [2022-07-23 14:26:24,450 INFO L390 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 14:26:24,493 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,520 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,561 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,598 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,640 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,698 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 [2022-07-23 14:26:24,705 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,744 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-23 14:26:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:24,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 14:26:24,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:24,849 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2022-07-23 14:26:24,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:24,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 24 transitions. cyclomatic complexity: 3. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 33 transitions. Complement of second has 15 states. [2022-07-23 14:26:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2022-07-23 14:26:24,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-23 14:26:24,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:24,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 22 letters. Loop has 3 letters. [2022-07-23 14:26:24,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:24,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 28 transitions. Stem has 19 letters. Loop has 6 letters. [2022-07-23 14:26:24,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:24,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2022-07-23 14:26:24,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:24,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2022-07-23 14:26:24,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-23 14:26:24,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-23 14:26:24,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2022-07-23 14:26:24,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:24,996 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-23 14:26:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2022-07-23 14:26:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-23 14:26:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-23 14:26:24,997 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-23 14:26:24,997 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-23 14:26:24,997 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-23 14:26:24,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-07-23 14:26:24,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:26:24,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:24,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:24,998 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:26:24,998 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:26:24,998 INFO L752 eck$LassoCheckResult]: Stem: 1699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~mem23#1, main_#t~mem24#1, main_#t~post25#1, main_#t~mem26#1, main_#t~post27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~post30#1, main_#t~mem31#1, main_#t~post32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~post35#1, main_#t~mem36#1, main_#t~post37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~post40#1, main_#t~mem41#1, main_#t~post42#1, main_#t~mem43#1, main_#t~mem44#1, main_#t~post45#1, main_#t~mem46#1, main_#t~post47#1, main_#t~mem51#1, main_#t~mem52#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~short50#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset, main_~m~0#1.base, main_~m~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~m~0#1.base, main_~m~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 1713#L553 assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1;call write~int(-1, main_~x~0#1.base, main_~x~0#1.offset, 4); 1709#L553-2 call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1710#L558 assume !(main_#t~mem8#1 > 0);havoc main_#t~mem8#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post12#1 := main_#t~mem11#1;call write~int(main_#t~post12#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~post12#1; 1711#L558-2 call main_#t~mem13#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1712#L563 assume !(main_#t~mem13#1 > 0);havoc main_#t~mem13#1;call main_#t~mem16#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post17#1 := main_#t~mem16#1;call write~int(main_#t~post17#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~post17#1; 1714#L563-2 call main_#t~mem18#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1715#L568 assume !(main_#t~mem18#1 > 0);havoc main_#t~mem18#1;call main_#t~mem21#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post22#1 := main_#t~mem21#1;call write~int(main_#t~post22#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem21#1;havoc main_#t~post22#1; 1720#L568-2 call main_#t~mem23#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1705#L573 assume !(main_#t~mem23#1 > 0);havoc main_#t~mem23#1;call main_#t~mem26#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post27#1 := main_#t~mem26#1;call write~int(main_#t~post27#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem26#1;havoc main_#t~post27#1; 1706#L573-2 call main_#t~mem28#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1717#L578 assume !(main_#t~mem28#1 > 0);havoc main_#t~mem28#1;call main_#t~mem31#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post32#1 := main_#t~mem31#1;call write~int(main_#t~post32#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem31#1;havoc main_#t~post32#1; 1701#L578-2 call main_#t~mem33#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1702#L583 assume !(main_#t~mem33#1 > 0);havoc main_#t~mem33#1;call main_#t~mem36#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post37#1 := main_#t~mem36#1;call write~int(main_#t~post37#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem36#1;havoc main_#t~post37#1; 1718#L583-2 call main_#t~mem38#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1707#L588 assume !(main_#t~mem38#1 > 0);havoc main_#t~mem38#1;call main_#t~mem41#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int(main_#t~post42#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1; 1708#L588-2 call main_#t~mem43#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 1716#L593 assume main_#t~mem43#1 > 0;havoc main_#t~mem43#1;call main_#t~mem44#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post45#1 := main_#t~mem44#1;call write~int(1 + main_#t~post45#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem44#1;havoc main_#t~post45#1; 1703#L598-4 [2022-07-23 14:26:24,998 INFO L754 eck$LassoCheckResult]: Loop: 1703#L598-4 call main_#t~mem48#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short50#1 := main_#t~mem48#1 < 100; 1704#L598 assume main_#t~short50#1;call main_#t~mem49#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short50#1 := main_#t~mem49#1 < 100; 1719#L598-2 assume !!main_#t~short50#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~short50#1;call main_#t~mem51#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem51#1 + main_#t~mem52#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem53#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call main_#t~mem54#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem53#1 - main_#t~mem54#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem53#1;havoc main_#t~mem54#1; 1703#L598-4 [2022-07-23 14:26:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 189283146, now seen corresponding path program 1 times [2022-07-23 14:26:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:24,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063921558] [2022-07-23 14:26:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:25,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063921558] [2022-07-23 14:26:25,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063921558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:25,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:25,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 14:26:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727014057] [2022-07-23 14:26:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:25,103 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:26:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash 97419, now seen corresponding path program 14 times [2022-07-23 14:26:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808177077] [2022-07-23 14:26:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:25,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:25,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 14:26:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-23 14:26:25,226 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:25,272 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-07-23 14:26:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 14:26:25,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 18 transitions. [2022-07-23 14:26:25,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:26:25,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:26:25,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:26:25,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:25,273 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-23 14:26:25,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:26:25,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:26:25,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:26:25,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:26:25 BoogieIcfgContainer [2022-07-23 14:26:25,278 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:26:25,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:26:25,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:26:25,278 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:26:25,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:06" (3/4) ... [2022-07-23 14:26:25,280 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:26:25,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:26:25,280 INFO L158 Benchmark]: Toolchain (without parser) took 19713.29ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 57.7MB in the beginning and 119.2MB in the end (delta: -61.5MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.27ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 57.5MB in the beginning and 128.6MB in the end (delta: -71.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.82ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: Boogie Preprocessor took 24.84ms. Allocated memory is still 159.4MB. Free memory was 126.5MB in the beginning and 124.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: RCFGBuilder took 362.22ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 108.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: BuchiAutomizer took 18952.42ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 108.1MB in the beginning and 120.2MB in the end (delta: -12.1MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2022-07-23 14:26:25,281 INFO L158 Benchmark]: Witness Printer took 2.07ms. Allocated memory is still 243.3MB. Free memory was 120.2MB in the beginning and 119.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:26:25,282 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.15ms. Allocated memory is still 117.4MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.27ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 57.5MB in the beginning and 128.6MB in the end (delta: -71.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.82ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.84ms. Allocated memory is still 159.4MB. Free memory was 126.5MB in the beginning and 124.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.22ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 108.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 18952.42ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 108.1MB in the beginning and 120.2MB in the end (delta: -12.1MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 2.07ms. Allocated memory is still 243.3MB. Free memory was 120.2MB in the beginning and 119.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y][y] + 100 and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z][z] + 100 and consists of 13 locations. 12 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.9s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 16.2s. Construction of modules took 0.9s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 117 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2202 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 235 mSDtfsCounter, 2202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital332 mio100 ax105 hnf100 lsp89 ukn60 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 14:26:25,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE