./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/reducercommutativity/sum05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 10:15:57,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:15:57,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:15:57,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:15:57,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:15:57,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:15:57,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:15:57,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:15:57,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:15:57,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:15:57,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:15:57,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:15:57,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:15:57,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:15:57,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:15:57,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:15:57,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:15:57,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:15:57,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:15:57,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:15:57,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:15:57,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:15:57,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:15:57,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:15:57,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:15:57,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:15:57,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:15:57,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:15:57,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:15:57,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:15:57,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:15:57,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:15:57,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:15:57,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:15:57,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:15:57,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:15:57,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:15:57,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:15:57,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:15:57,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:15:57,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:15:57,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:15:57,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:15:57,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:15:57,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:15:57,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:15:57,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:15:57,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:15:57,416 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:15:57,416 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:15:57,416 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:15:57,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:15:57,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:15:57,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:15:57,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:15:57,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:15:57,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:15:57,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:15:57,419 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:15:57,419 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2021-12-16 10:15:57,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:15:57,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:15:57,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:15:57,614 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:15:57,615 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:15:57,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-12-16 10:15:57,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b9a1e53/4c0465f7d614449da9454e3013f51471/FLAG7de7af455 [2021-12-16 10:15:58,030 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:15:58,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-12-16 10:15:58,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b9a1e53/4c0465f7d614449da9454e3013f51471/FLAG7de7af455 [2021-12-16 10:15:58,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b9a1e53/4c0465f7d614449da9454e3013f51471 [2021-12-16 10:15:58,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:15:58,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:15:58,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:15:58,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:15:58,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:15:58,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d58eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58, skipping insertion in model container [2021-12-16 10:15:58,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:15:58,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:15:58,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2021-12-16 10:15:58,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:15:58,197 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:15:58,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2021-12-16 10:15:58,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:15:58,217 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:15:58,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58 WrapperNode [2021-12-16 10:15:58,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:15:58,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:15:58,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:15:58,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:15:58,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,241 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2021-12-16 10:15:58,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:15:58,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:15:58,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:15:58,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:15:58,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:15:58,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:15:58,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:15:58,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:15:58,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (1/1) ... [2021-12-16 10:15:58,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:58,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 10:15:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:15:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:15:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 10:15:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 10:15:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:15:58,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:15:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 10:15:58,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 10:15:58,389 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:15:58,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:15:58,530 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:15:58,534 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:15:58,535 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-16 10:15:58,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:58 BoogieIcfgContainer [2021-12-16 10:15:58,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:15:58,537 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:15:58,537 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:15:58,545 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:15:58,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:58,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:15:58" (1/3) ... [2021-12-16 10:15:58,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@727aeb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:15:58, skipping insertion in model container [2021-12-16 10:15:58,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:58,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:58" (2/3) ... [2021-12-16 10:15:58,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@727aeb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:15:58, skipping insertion in model container [2021-12-16 10:15:58,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:58,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:58" (3/3) ... [2021-12-16 10:15:58,548 INFO L388 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2021-12-16 10:15:58,577 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:15:58,577 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:15:58,577 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:15:58,577 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:15:58,577 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:15:58,578 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:15:58,578 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:15:58,578 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:15:58,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:58,602 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-12-16 10:15:58,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:58,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:58,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 10:15:58,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:15:58,606 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:15:58,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:58,609 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2021-12-16 10:15:58,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:58,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:58,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 10:15:58,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:15:58,614 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 15#L34-3true [2021-12-16 10:15:58,614 INFO L793 eck$LassoCheckResult]: Loop: 15#L34-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 11#L34-2true main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 15#L34-3true [2021-12-16 10:15:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 10:15:58,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:58,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102108110] [2021-12-16 10:15:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:58,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-16 10:15:58,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:58,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453210345] [2021-12-16 10:15:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:58,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-16 10:15:58,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721649420] [2021-12-16 10:15:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:58,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:58,760 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:58,961 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:15:58,962 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:15:58,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:15:58,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:15:58,962 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:15:58,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:15:58,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:15:58,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2021-12-16 10:15:58,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:15:58,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:15:58,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:59,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:15:59,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:15:59,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-16 10:15:59,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-16 10:15:59,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-16 10:15:59,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-16 10:15:59,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-16 10:15:59,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-16 10:15:59,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:59,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:59,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-16 10:15:59,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,520 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 [2021-12-16 10:15:59,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-16 10:15:59,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-16 10:15:59,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-16 10:15:59,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 10:15:59,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-16 10:15:59,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,708 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-16 10:15:59,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:59,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:59,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:59,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,736 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-16 10:15:59,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:59,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:59,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-16 10:15:59,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-16 10:15:59,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:59,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:59,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:59,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,817 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-16 10:15:59,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:59,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:59,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:59,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:59,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:59,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:59,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:59,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:15:59,892 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-16 10:15:59,893 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-16 10:15:59,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:59,895 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:59,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:15:59,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-16 10:15:59,943 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:15:59,943 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:15:59,944 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2021-12-16 10:15:59,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,975 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-12-16 10:15:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:16:00,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:16:00,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,084 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 10:16:00,085 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,143 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 92 transitions. Complement of second has 8 states. [2021-12-16 10:16:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 10:16:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2021-12-16 10:16:00,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-16 10:16:00,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:00,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-16 10:16:00,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:00,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-16 10:16:00,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:00,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2021-12-16 10:16:00,160 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2021-12-16 10:16:00,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-16 10:16:00,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 10:16:00,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-12-16 10:16:00,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:00,166 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-16 10:16:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-12-16 10:16:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-16 10:16:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-12-16 10:16:00,184 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-16 10:16:00,184 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-16 10:16:00,184 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:16:00,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2021-12-16 10:16:00,186 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:00,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:00,187 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 10:16:00,187 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:00,187 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 163#L34-3 assume !(main_~i~1#1 < 5); 155#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 156#L20-3 [2021-12-16 10:16:00,188 INFO L793 eck$LassoCheckResult]: Loop: 156#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 169#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 156#L20-3 [2021-12-16 10:16:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-16 10:16:00,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244562958] [2021-12-16 10:16:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:00,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244562958] [2021-12-16 10:16:00,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244562958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:16:00,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:16:00,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:16:00,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737742622] [2021-12-16 10:16:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:16:00,240 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-12-16 10:16:00,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827034874] [2021-12-16 10:16:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,262 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:00,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:16:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:16:00,314 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:00,325 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-16 10:16:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:16:00,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2021-12-16 10:16:00,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2021-12-16 10:16:00,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-16 10:16:00,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 10:16:00,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-12-16 10:16:00,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:00,327 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-16 10:16:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-12-16 10:16:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-16 10:16:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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) [2021-12-16 10:16:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-16 10:16:00,329 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-16 10:16:00,329 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-16 10:16:00,329 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:16:00,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-12-16 10:16:00,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:00,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:00,329 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 10:16:00,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:00,329 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 208#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 211#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 212#L34-3 assume !(main_~i~1#1 < 5); 200#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 201#L20-3 [2021-12-16 10:16:00,329 INFO L793 eck$LassoCheckResult]: Loop: 201#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 214#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 201#L20-3 [2021-12-16 10:16:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-12-16 10:16:00,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060869653] [2021-12-16 10:16:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060869653] [2021-12-16 10:16:00,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060869653] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:16:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552688785] [2021-12-16 10:16:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:16:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:00,351 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:16:00,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-16 10:16:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 10:16:00,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:16:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552688785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:16:00,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:16:00,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-16 10:16:00,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392523414] [2021-12-16 10:16:00,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:16:00,422 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-12-16 10:16:00,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220530165] [2021-12-16 10:16:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,428 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:00,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 10:16:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 10:16:00,454 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:00,477 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-12-16 10:16:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 10:16:00,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2021-12-16 10:16:00,480 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2021-12-16 10:16:00,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-16 10:16:00,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 10:16:00,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2021-12-16 10:16:00,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:00,482 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-16 10:16:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2021-12-16 10:16:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-16 10:16:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-16 10:16:00,488 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-16 10:16:00,488 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-16 10:16:00,488 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:16:00,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-12-16 10:16:00,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:00,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:00,491 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-12-16 10:16:00,491 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:00,491 INFO L791 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 292#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 299#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 300#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 295#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 296#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 304#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 303#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 302#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 301#L34-3 assume !(main_~i~1#1 < 5); 284#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 285#L20-3 [2021-12-16 10:16:00,491 INFO L793 eck$LassoCheckResult]: Loop: 285#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 298#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 285#L20-3 [2021-12-16 10:16:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-12-16 10:16:00,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590950818] [2021-12-16 10:16:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590950818] [2021-12-16 10:16:00,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590950818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:16:00,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960425863] [2021-12-16 10:16:00,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 10:16:00,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:16:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:00,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:16:00,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-16 10:16:00,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 10:16:00,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 10:16:00,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:16:00,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:16:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:00,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960425863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:16:00,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:16:00,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-16 10:16:00,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421017672] [2021-12-16 10:16:00,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:16:00,655 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:00,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-12-16 10:16:00,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819735366] [2021-12-16 10:16:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,675 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:00,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:16:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 10:16:00,704 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:00,722 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-12-16 10:16:00,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 10:16:00,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2021-12-16 10:16:00,725 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 10:16:00,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-16 10:16:00,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-16 10:16:00,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2021-12-16 10:16:00,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:00,727 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 10:16:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2021-12-16 10:16:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-16 10:16:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-16 10:16:00,729 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 10:16:00,729 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-16 10:16:00,729 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 10:16:00,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2021-12-16 10:16:00,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2021-12-16 10:16:00,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:00,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:00,731 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-12-16 10:16:00,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:00,732 INFO L791 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 421#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 428#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 429#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 424#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 425#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 435#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 434#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 433#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 432#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 431#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 430#L34-3 assume !(main_~i~1#1 < 5); 413#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 414#L20-3 [2021-12-16 10:16:00,732 INFO L793 eck$LassoCheckResult]: Loop: 414#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 427#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 414#L20-3 [2021-12-16 10:16:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-12-16 10:16:00,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173134664] [2021-12-16 10:16:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,781 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-12-16 10:16:00,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52391354] [2021-12-16 10:16:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,796 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2021-12-16 10:16:00,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:00,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095956153] [2021-12-16 10:16:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:00,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:00,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:01,393 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:16:01,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:16:01,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:16:01,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:16:01,393 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:16:01,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:01,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:16:01,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:16:01,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration5_Lasso [2021-12-16 10:16:01,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:16:01,393 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:16:01,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:01,895 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:16:01,895 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:16:01,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:01,932 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:01,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-16 10:16:01,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:01,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:01,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:01,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:01,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:01,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:01,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:01,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:01,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:01,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:01,967 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:01,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-16 10:16:01,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:01,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:01,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:01,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:01,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:01,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:01,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:01,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:02,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,003 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-16 10:16:02,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:02,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,093 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-16 10:16:02,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,126 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 [2021-12-16 10:16:02,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,127 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-16 10:16:02,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,153 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 [2021-12-16 10:16:02,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,158 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-16 10:16:02,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,183 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 [2021-12-16 10:16:02,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,184 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-16 10:16:02,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:02,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,213 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-16 10:16:02,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:02,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,255 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-16 10:16:02,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:02,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-16 10:16:02,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,289 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-16 10:16:02,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:02,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:02,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:02,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:02,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:02,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:02,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:02,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:16:02,327 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-16 10:16:02,327 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-16 10:16:02,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,328 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-16 10:16:02,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:16:02,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:16:02,336 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:16:02,336 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x#1.base)_1, ULTIMATE.start_sum_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_sum_~x#1.base)_1 - 8*ULTIMATE.start_sum_~i~0#1 Supporting invariants [] [2021-12-16 10:16:02,351 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 [2021-12-16 10:16:02,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:02,417 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2021-12-16 10:16:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:16:02,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:16:02,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:02,492 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 10:16:02,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 38 transitions. Complement of second has 7 states. [2021-12-16 10:16:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 10:16:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-12-16 10:16:02,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2021-12-16 10:16:02,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:02,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2021-12-16 10:16:02,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:02,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-16 10:16:02,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:02,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-12-16 10:16:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2021-12-16 10:16:02,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-16 10:16:02,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-16 10:16:02,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-16 10:16:02,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:02,506 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:16:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-16 10:16:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-16 10:16:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-16 10:16:02,508 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:16:02,508 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-16 10:16:02,508 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 10:16:02,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-12-16 10:16:02,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:02,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:02,509 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:16:02,509 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:02,509 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 667#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 675#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 676#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 670#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 671#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 682#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 681#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 680#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 679#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 678#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 677#L34-3 assume !(main_~i~1#1 < 5); 659#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 660#L20-3 assume !(sum_~i~0#1 < 5); 668#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 669#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 665#L20-8 [2021-12-16 10:16:02,510 INFO L793 eck$LassoCheckResult]: Loop: 665#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 666#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 665#L20-8 [2021-12-16 10:16:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2021-12-16 10:16:02,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587175612] [2021-12-16 10:16:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:16:02,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:02,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587175612] [2021-12-16 10:16:02,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587175612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:16:02,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:16:02,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:16:02,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888637069] [2021-12-16 10:16:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:16:02,530 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2021-12-16 10:16:02,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636149499] [2021-12-16 10:16:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:02,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:16:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:16:02,562 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:02,576 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-16 10:16:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:16:02,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2021-12-16 10:16:02,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2021-12-16 10:16:02,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:16:02,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:16:02,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2021-12-16 10:16:02,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:02,579 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-16 10:16:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2021-12-16 10:16:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-16 10:16:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-16 10:16:02,580 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-16 10:16:02,580 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-16 10:16:02,581 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 10:16:02,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2021-12-16 10:16:02,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:02,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:02,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:16:02,582 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:02,582 INFO L791 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 734#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 737#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 738#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 743#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 750#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 749#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 748#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 747#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 746#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 745#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 744#L34-3 assume !(main_~i~1#1 < 5); 726#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 727#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 740#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 741#L20-3 assume !(sum_~i~0#1 < 5); 735#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 736#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 732#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 733#L20-7 [2021-12-16 10:16:02,582 INFO L793 eck$LassoCheckResult]: Loop: 733#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 742#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 733#L20-7 [2021-12-16 10:16:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2021-12-16 10:16:02,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182189042] [2021-12-16 10:16:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:16:02,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:02,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182189042] [2021-12-16 10:16:02,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182189042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:16:02,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761625120] [2021-12-16 10:16:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:16:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,610 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-16 10:16:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 10:16:02,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:16:02,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:16:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:16:02,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761625120] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:16:02,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:16:02,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-16 10:16:02,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015494966] [2021-12-16 10:16:02,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:16:02,710 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2021-12-16 10:16:02,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855615762] [2021-12-16 10:16:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:02,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 10:16:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 10:16:02,743 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 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) [2021-12-16 10:16:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:02,780 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-12-16 10:16:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 10:16:02,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 52 transitions. [2021-12-16 10:16:02,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 52 transitions. [2021-12-16 10:16:02,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-16 10:16:02,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-16 10:16:02,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 52 transitions. [2021-12-16 10:16:02,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:02,785 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-12-16 10:16:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 52 transitions. [2021-12-16 10:16:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2021-12-16 10:16:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-12-16 10:16:02,788 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-12-16 10:16:02,788 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-12-16 10:16:02,789 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 10:16:02,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2021-12-16 10:16:02,789 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:02,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:02,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:02,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:16:02,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:02,791 INFO L791 eck$LassoCheckResult]: Stem: 925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 935#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 938#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 939#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 945#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 963#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 962#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 961#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 960#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 959#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 958#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 957#L34-3 assume !(main_~i~1#1 < 5); 927#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 928#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 941#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 942#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 943#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 956#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 955#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 954#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 951#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 950#L20-3 assume !(sum_~i~0#1 < 5); 936#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 937#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 933#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 934#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 944#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 953#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 952#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 949#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 948#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 947#L20-7 [2021-12-16 10:16:02,791 INFO L793 eck$LassoCheckResult]: Loop: 947#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 946#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 947#L20-7 [2021-12-16 10:16:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 1 times [2021-12-16 10:16:02,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978090875] [2021-12-16 10:16:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-16 10:16:02,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:02,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978090875] [2021-12-16 10:16:02,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978090875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:16:02,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20977922] [2021-12-16 10:16:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:16:02,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:02,852 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:16:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-16 10:16:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:02,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:16:02,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-16 10:16:02,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:16:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-16 10:16:02,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20977922] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:16:02,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:16:02,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-16 10:16:02,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170410342] [2021-12-16 10:16:02,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:16:02,988 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:16:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2021-12-16 10:16:02,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999719936] [2021-12-16 10:16:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:02,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,991 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:02,992 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:03,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:16:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 10:16:03,015 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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) [2021-12-16 10:16:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:03,058 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-12-16 10:16:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 10:16:03,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2021-12-16 10:16:03,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:03,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2021-12-16 10:16:03,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2021-12-16 10:16:03,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-16 10:16:03,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2021-12-16 10:16:03,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:03,060 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-12-16 10:16:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2021-12-16 10:16:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2021-12-16 10:16:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-12-16 10:16:03,061 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-12-16 10:16:03,062 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-12-16 10:16:03,062 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 10:16:03,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2021-12-16 10:16:03,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-16 10:16:03,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:03,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:03,062 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:16:03,062 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:03,063 INFO L791 eck$LassoCheckResult]: Stem: 1215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1227#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1230#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1231#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1237#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1259#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1258#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1257#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1256#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1255#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1254#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1253#L34-3 assume !(main_~i~1#1 < 5); 1219#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1220#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1233#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1234#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1235#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1252#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1251#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1249#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1247#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1245#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1242#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1241#L20-3 assume !(sum_~i~0#1 < 5); 1228#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1229#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1225#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1226#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1236#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1250#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1248#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1246#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1244#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1243#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1240#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1239#L20-7 [2021-12-16 10:16:03,063 INFO L793 eck$LassoCheckResult]: Loop: 1239#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1238#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1239#L20-7 [2021-12-16 10:16:03,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 2 times [2021-12-16 10:16:03,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743155848] [2021-12-16 10:16:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2021-12-16 10:16:03,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654177283] [2021-12-16 10:16:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,188 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 3 times [2021-12-16 10:16:03,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076144791] [2021-12-16 10:16:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-16 10:16:03,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:16:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076144791] [2021-12-16 10:16:03,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076144791] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:16:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162793789] [2021-12-16 10:16:03,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 10:16:03,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:16:03,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:03,245 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:16:03,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-16 10:16:03,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 10:16:03,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 10:16:03,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 10:16:03,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-16 10:16:03,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 10:16:03,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162793789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:16:03,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 10:16:03,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-12-16 10:16:03,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891384056] [2021-12-16 10:16:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:16:03,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:16:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:16:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-16 10:16:03,387 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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) [2021-12-16 10:16:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:16:03,440 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2021-12-16 10:16:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 10:16:03,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2021-12-16 10:16:03,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 10:16:03,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2021-12-16 10:16:03,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-16 10:16:03,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-16 10:16:03,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2021-12-16 10:16:03,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:03,442 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-12-16 10:16:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2021-12-16 10:16:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-16 10:16:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 41 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) [2021-12-16 10:16:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-12-16 10:16:03,444 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-12-16 10:16:03,444 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-12-16 10:16:03,444 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 10:16:03,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2021-12-16 10:16:03,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 10:16:03,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:16:03,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:16:03,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:16:03,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:16:03,446 INFO L791 eck$LassoCheckResult]: Stem: 1441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1449#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1457#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1458#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1452#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1453#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1480#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1479#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1478#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1477#L34-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1476#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1475#L34-3 assume !(main_~i~1#1 < 5); 1443#L34-4 assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1444#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1454#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1455#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1473#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1471#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1469#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1467#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1465#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1463#L20-3 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1461#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1460#L20-3 assume !(sum_~i~0#1 < 5); 1450#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1451#L23 main_#t~ret5#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1447#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1448#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1456#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1474#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1472#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1470#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1468#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1466#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1464#L20-8 assume !!(sum_~i~0#1 < 5);call sum_#t~mem2#1 := read~int(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1462#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1459#L20-8 assume !(sum_~i~0#1 < 5); 1439#L20-9 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1440#L23-1 main_#t~ret8#1 := sum_#res#1;assume { :end_inline_sum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1446#L43-3 [2021-12-16 10:16:03,446 INFO L793 eck$LassoCheckResult]: Loop: 1446#L43-3 assume !!(main_~i~2#1 < 4);call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem11#1; 1445#L43-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1446#L43-3 [2021-12-16 10:16:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2021-12-16 10:16:03,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504558396] [2021-12-16 10:16:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,506 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2021-12-16 10:16:03,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111907206] [2021-12-16 10:16:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,515 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2021-12-16 10:16:03,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:16:03,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849344826] [2021-12-16 10:16:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:16:03,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:16:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:16:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:16:03,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:16:07,775 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:16:07,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:16:07,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:16:07,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:16:07,776 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:16:07,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:07,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:16:07,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:16:07,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration10_Lasso [2021-12-16 10:16:07,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:16:07,776 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:16:07,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:07,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:08,620 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-16 10:16:09,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:09,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:16:10,967 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:16:10,967 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:16:10,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:10,968 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:10,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-16 10:16:10,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:10,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:10,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:10,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:10,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:10,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:10,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:10,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:10,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:10,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:10,999 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-16 10:16:11,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-16 10:16:11,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,028 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) [2021-12-16 10:16:11,028 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 [2021-12-16 10:16:11,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,053 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 [2021-12-16 10:16:11,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,055 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) [2021-12-16 10:16:11,055 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 [2021-12-16 10:16:11,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-16 10:16:11,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,100 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-16 10:16:11,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:11,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,158 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-16 10:16:11,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,198 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 [2021-12-16 10:16:11,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,199 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-16 10:16:11,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-16 10:16:11,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,225 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-16 10:16:11,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,255 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 [2021-12-16 10:16:11,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,256 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-16 10:16:11,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-16 10:16:11,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,285 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-16 10:16:11,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:11,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,320 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-16 10:16:11,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-16 10:16:11,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,399 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-16 10:16:11,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:11,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,426 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-16 10:16:11,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-16 10:16:11,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,457 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-16 10:16:11,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:16:11,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:16:11,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:16:11,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,497 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 [2021-12-16 10:16:11,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,499 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-16 10:16:11,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,526 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 [2021-12-16 10:16:11,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,527 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-16 10:16:11,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-16 10:16:11,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,556 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-16 10:16:11,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,617 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 [2021-12-16 10:16:11,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,620 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-16 10:16:11,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:11,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,650 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-16 10:16:11,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,676 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 [2021-12-16 10:16:11,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,677 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-16 10:16:11,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,686 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-16 10:16:11,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,720 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-16 10:16:11,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:16:11,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-16 10:16:11,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,756 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-16 10:16:11,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:16:11,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:16:11,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:16:11,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:16:11,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:16:11,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:16:11,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:16:11,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:16:11,829 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2021-12-16 10:16:11,829 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-12-16 10:16:11,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:16:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:16:11,831 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:16:11,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:16:11,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-16 10:16:11,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:16:11,843 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:16:11,843 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x#1.base)_2, ULTIMATE.start_main_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_sum_~x#1.base)_2 - 4*ULTIMATE.start_main_~i~2#1 Supporting invariants [] [2021-12-16 10:16:11,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:12,081 INFO L297 tatePredicateManager]: 74 out of 76 supporting invariants were superfluous and have been removed [2021-12-16 10:16:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:16:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:12,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 10:16:12,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:12,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:16:12,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 10:16:12,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:16:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:16:12,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-16 10:16:12,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:12,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 44 states and 46 transitions. Complement of second has 6 states. [2021-12-16 10:16:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-16 10:16:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:16:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2021-12-16 10:16:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2021-12-16 10:16:12,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:12,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2021-12-16 10:16:12,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:12,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2021-12-16 10:16:12,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:16:12,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2021-12-16 10:16:12,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:16:12,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2021-12-16 10:16:12,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 10:16:12,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 10:16:12,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 10:16:12,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:16:12,364 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:16:12,364 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:16:12,364 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:16:12,364 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 10:16:12,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-16 10:16:12,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:16:12,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-16 10:16:12,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 10:16:12 BoogieIcfgContainer [2021-12-16 10:16:12,372 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 10:16:12,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 10:16:12,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 10:16:12,373 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 10:16:12,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:58" (3/4) ... [2021-12-16 10:16:12,375 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 10:16:12,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 10:16:12,375 INFO L158 Benchmark]: Toolchain (without parser) took 14323.06ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 70.1MB in the beginning and 107.4MB in the end (delta: -37.3MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2021-12-16 10:16:12,375 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.67ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 59.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.73ms. Allocated memory is still 92.3MB. Free memory was 59.7MB in the beginning and 57.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: Boogie Preprocessor took 17.44ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: RCFGBuilder took 276.78ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 45.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: BuchiAutomizer took 13835.13ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 44.8MB in the beginning and 107.4MB in the end (delta: -62.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2021-12-16 10:16:12,376 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 161.5MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:16:12,377 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.16ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 69.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.67ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 59.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.73ms. Allocated memory is still 92.3MB. Free memory was 59.7MB in the beginning and 57.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.44ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.78ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 45.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13835.13ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 44.8MB in the beginning and 107.4MB in the end (delta: -62.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 161.5MB. Free memory is still 107.4MB. 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 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.7s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 12.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 154 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital510 mio100 ax100 hnf100 lsp120 ukn64 mio100 lsp40 div100 bol100 ite100 ukn100 eq170 hnf87 smp91 dnf247 smp76 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms VariablesStem: 26 VariablesLoop: 20 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-16 10:16:12,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:12,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-12-16 10:16:12,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-12-16 10:16:13,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-16 10:16:13,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-16 10:16:13,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE