./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a2f1dacf23e701c88af5ee644fdcccaa723983d694e8bd4147c38940002aa7b2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:50,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:50,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:50,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:50,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:50,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:50,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:50,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:50,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:50,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:50,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:50,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:50,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:50,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:50,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:50,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:50,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:50,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:50,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:50,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:50,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:50,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:50,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:50,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:50,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:50,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:50,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:50,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:50,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:50,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:50,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:50,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:50,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:50,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:50,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:50,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:50,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:50,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:50,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:50,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:50,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:50,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:50,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:50,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:50,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:50,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:50,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:50,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:50,562 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:50,563 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:50,563 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:50,563 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:50,564 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:50,564 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:50,564 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:50,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:50,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:50,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:50,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:50,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:50,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:50,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:50,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:50,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:50,567 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:50,567 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f1dacf23e701c88af5ee644fdcccaa723983d694e8bd4147c38940002aa7b2 [2022-02-21 03:35:50,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:50,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:50,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:50,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:50,828 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:50,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i [2022-02-21 03:35:50,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c0d056/2ed07dcd89e942ddb83058d749f1d092/FLAG7a91a92ba [2022-02-21 03:35:51,186 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:51,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B.i [2022-02-21 03:35:51,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c0d056/2ed07dcd89e942ddb83058d749f1d092/FLAG7a91a92ba [2022-02-21 03:35:51,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270c0d056/2ed07dcd89e942ddb83058d749f1d092 [2022-02-21 03:35:51,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:51,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:51,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:51,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:51,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:51,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332d4ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51, skipping insertion in model container [2022-02-21 03:35:51,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:51,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:51,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:51,827 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:51,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:51,859 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:51,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51 WrapperNode [2022-02-21 03:35:51,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:51,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:51,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:51,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:51,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,893 INFO L137 Inliner]: procedures = 12, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-02-21 03:35:51,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:51,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:51,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:51,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:51,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:51,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:51,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:51,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:51,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (1/1) ... [2022-02-21 03:35:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-21 03:35:51,980 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-21 03:35:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:35:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:35:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:51,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:52,051 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:52,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:52,384 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:52,390 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:52,390 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:52,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:52 BoogieIcfgContainer [2022-02-21 03:35:52,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:52,392 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:52,393 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:52,395 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:52,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:52,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:51" (1/3) ... [2022-02-21 03:35:52,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e511b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:52, skipping insertion in model container [2022-02-21 03:35:52,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:52,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:51" (2/3) ... [2022-02-21 03:35:52,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e511b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:52, skipping insertion in model container [2022-02-21 03:35:52,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:52,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:52" (3/3) ... [2022-02-21 03:35:52,403 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5B.i [2022-02-21 03:35:52,459 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:52,459 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:52,459 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:52,459 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:52,459 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:52,459 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:52,459 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:52,459 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:52,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:52,507 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:52,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,514 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:52,514 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:52,514 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:52,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:52,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:52,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:52,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:52,525 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 27#L76true assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 21#L76-2true assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 20#L79true call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 23#fENTRYtrue [2022-02-21 03:35:52,526 INFO L793 eck$LassoCheckResult]: Loop: 23#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 26#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 10#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 24#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 11#L47true assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; 19#gFINALtrue assume true; 25#gEXITtrue >#53#return; 17#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 23#fENTRYtrue [2022-02-21 03:35:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 1 times [2022-02-21 03:35:52,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965410075] [2022-02-21 03:35:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,662 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1039736561, now seen corresponding path program 1 times [2022-02-21 03:35:52,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620480639] [2022-02-21 03:35:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {41#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:52,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {35#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {34#false} is VALID [2022-02-21 03:35:52,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {33#true} is VALID [2022-02-21 03:35:52,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {35#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:52,865 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {41#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:52,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,869 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {35#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {34#false} is VALID [2022-02-21 03:35:52,869 INFO L272 TraceCheckUtils]: 7: Hoare triple {34#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {34#false} is VALID [2022-02-21 03:35:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:52,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:52,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620480639] [2022-02-21 03:35:52,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620480639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:52,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:52,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:35:52,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802620616] [2022-02-21 03:35:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:52,875 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:52,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:35:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:35:52,900 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:53,198 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-21 03:35:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:35:53,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:53,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:53,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-02-21 03:35:53,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:53,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 32 transitions. [2022-02-21 03:35:53,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:35:53,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:35:53,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-02-21 03:35:53,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:53,224 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 03:35:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-02-21 03:35:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 03:35:53,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:53,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:35:53,242 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:35:53,243 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:35:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:53,246 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:35:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 03:35:53,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:53,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:53,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 25 states and 32 transitions. [2022-02-21 03:35:53,252 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 25 states and 32 transitions. [2022-02-21 03:35:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:53,259 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:35:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 03:35:53,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:53,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:53,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:53,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:35:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-21 03:35:53,269 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 03:35:53,273 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 03:35:53,274 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:53,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2022-02-21 03:35:53,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:53,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:53,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:53,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:53,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:53,276 INFO L791 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 92#L76 assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 90#L76-2 assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 75#L79 call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 79#fENTRY [2022-02-21 03:35:53,277 INFO L793 eck$LassoCheckResult]: Loop: 79#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 93#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 84#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 91#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 94#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 85#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 91#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 94#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; 83#gFINAL assume true; 86#gEXIT >#59#return; 96#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 97#gFINAL assume true; 98#gEXIT >#53#return; 76#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 79#fENTRY [2022-02-21 03:35:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 2 times [2022-02-21 03:35:53,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:53,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024404715] [2022-02-21 03:35:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:53,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:53,304 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1707443993, now seen corresponding path program 1 times [2022-02-21 03:35:53,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:53,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614779441] [2022-02-21 03:35:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,532 INFO L272 TraceCheckUtils]: 2: Hoare triple {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:53,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,535 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,537 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {155#false} is VALID [2022-02-21 03:35:53,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {154#true} is VALID [2022-02-21 03:35:53,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:53,540 INFO L272 TraceCheckUtils]: 2: Hoare triple {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:53,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,542 INFO L272 TraceCheckUtils]: 5: Hoare triple {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:53,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:53,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:53,545 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {169#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:53,547 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {155#false} is VALID [2022-02-21 03:35:53,547 INFO L272 TraceCheckUtils]: 13: Hoare triple {155#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {155#false} is VALID [2022-02-21 03:35:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:53,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:53,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614779441] [2022-02-21 03:35:53,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614779441] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:53,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477085700] [2022-02-21 03:35:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:53,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:35:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:35:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:53,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:35:56,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {154#true} is VALID [2022-02-21 03:35:56,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {183#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} is VALID [2022-02-21 03:35:56,209 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {187#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:56,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {187#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:56,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {194#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:35:56,211 INFO L272 TraceCheckUtils]: 5: Hoare triple {194#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {187#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:56,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {201#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem8|))} is VALID [2022-02-21 03:35:56,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) |g_#t~mem8|))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {205#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:56,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume true; {205#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:56,217 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {205#(and (= |#memory_int| |old(#memory_int)|) (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0))} {194#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_80))) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_80 1)))) (= |g_#in~p.base| g_~p.base))} #59#return; {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:56,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:56,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} assume true; {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} is VALID [2022-02-21 03:35:56,220 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {212#(and (< (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|) 0) (exists ((v_ArrVal_80 Int)) (and (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_80))) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_80 1)))))} {183#(and (= 0 f_~tmp~0.offset) (<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} #53#return; {155#false} is VALID [2022-02-21 03:35:56,220 INFO L272 TraceCheckUtils]: 13: Hoare triple {155#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {155#false} is VALID [2022-02-21 03:35:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:56,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:56,885 INFO L272 TraceCheckUtils]: 13: Hoare triple {155#false} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {155#false} is VALID [2022-02-21 03:35:56,887 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {155#false} is VALID [2022-02-21 03:35:56,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:56,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:56,889 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {240#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} #59#return; {174#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:56,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:56,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (not (< |g_#t~mem8| 0)))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {176#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:56,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {250#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (not (< |g_#t~mem8| 0)))} is VALID [2022-02-21 03:35:56,893 INFO L272 TraceCheckUtils]: 5: Hoare triple {240#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {254#(or (<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:35:56,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {240#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| g_~p.base) g_~p.offset)))} is VALID [2022-02-21 03:35:56,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {258#(or (<= 1 (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:56,895 INFO L272 TraceCheckUtils]: 2: Hoare triple {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {262#(or (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)))} is VALID [2022-02-21 03:35:56,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {156#(<= 1 (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:35:56,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {154#true} is VALID [2022-02-21 03:35:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:56,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477085700] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:56,896 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:56,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2022-02-21 03:35:56,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426389733] [2022-02-21 03:35:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:56,897 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:56,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:35:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=298, Unknown=3, NotChecked=0, Total=380 [2022-02-21 03:35:56,898 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 10 Second operand has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:58,266 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-21 03:35:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:35:58,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:35:58,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:58,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2022-02-21 03:35:58,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:58,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2022-02-21 03:35:58,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:35:58,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:35:58,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2022-02-21 03:35:58,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:58,316 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-21 03:35:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2022-02-21 03:35:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-02-21 03:35:58,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:58,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 38 transitions. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:35:58,319 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 38 transitions. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:35:58,319 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:35:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:58,321 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-21 03:35:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-21 03:35:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:58,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:58,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 30 states and 38 transitions. [2022-02-21 03:35:58,322 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 30 states and 38 transitions. [2022-02-21 03:35:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:58,324 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-21 03:35:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-21 03:35:58,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:58,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:58,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:35:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-21 03:35:58,327 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:58,327 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:35:58,327 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:58,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2022-02-21 03:35:58,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:58,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:58,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:58,329 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:58,329 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:58,329 INFO L791 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 320#L76 assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 315#L76-2 assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 304#L79 call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 309#fENTRY [2022-02-21 03:35:58,329 INFO L793 eck$LassoCheckResult]: Loop: 309#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 321#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 312#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 319#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 322#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 313#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 319#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 322#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 313#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 319#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 322#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; 311#gFINAL assume true; 314#gEXIT >#59#return; 324#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 325#gFINAL assume true; 329#gEXIT >#59#return; 327#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 328#gFINAL assume true; 326#gEXIT >#53#return; 303#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 309#fENTRY [2022-02-21 03:35:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 3 times [2022-02-21 03:35:58,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:58,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037972122] [2022-02-21 03:35:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,365 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 705855503, now seen corresponding path program 2 times [2022-02-21 03:35:58,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:58,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017662732] [2022-02-21 03:35:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,433 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1432639553, now seen corresponding path program 1 times [2022-02-21 03:35:58,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:58,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585210212] [2022-02-21 03:35:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:58,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:04,117 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:04,118 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:04,118 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:04,118 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:04,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:04,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:04,118 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:04,118 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B.i_Iteration3_Lasso [2022-02-21 03:36:04,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:04,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:04,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,413 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 03:36:04,415 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:36:04,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:05,170 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:05,173 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:05,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:05,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:05,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,299 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 [2022-02-21 03:36:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:05,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,327 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 [2022-02-21 03:36:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:05,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:05,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:05,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,452 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 [2022-02-21 03:36:05,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:05,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:05,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:36:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:05,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:36:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,555 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:05,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,581 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:05,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,606 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 [2022-02-21 03:36:05,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:36:05,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:05,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:05,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:36:05,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:36:05,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:36:05,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:36:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,710 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:36:05,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:36:05,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,738 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:36:05,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:36:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,765 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:36:05,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,803 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 [2022-02-21 03:36:05,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,805 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:36:05,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,831 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:36:05,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,857 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:36:05,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:36:05,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,881 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:36:05,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,913 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:36:05,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:36:05,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:36:05,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:05,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:36:05,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:05,973 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:05,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:36:05,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:05,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:05,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:05,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:05,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:05,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:05,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:05,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:05,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,011 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:36:06,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,036 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 [2022-02-21 03:36:06,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,037 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:36:06,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,068 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:36:06,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:36:06,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,093 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:36:06,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 [2022-02-21 03:36:06,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:36:06,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,119 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:36:06,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,149 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:36:06,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:36:06,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,176 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:36:06,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 03:36:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,207 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:36:06,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:06,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:06,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,254 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 [2022-02-21 03:36:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,256 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:36:06,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,285 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:36:06,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,328 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:36:06,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:06,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:06,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:06,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:36:06,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,354 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:36:06,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:06,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:06,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,407 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:36:06,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:06,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:06,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:06,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,438 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:36:06,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:06,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:06,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:06,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:06,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:06,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:06,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:06,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:06,472 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:06,472 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:06,475 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:06,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:36:06,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:06,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:06,508 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:06,509 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2022-02-21 03:36:06,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,552 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:06,557 INFO L390 LassoCheck]: Loop: "~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v;" "assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11;" "call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11;" "call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset;" "assume true;" >"#59#return;" "~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset;" "assume true;" >"#59#return;" "~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset;" "assume true;" >"#53#return;" "call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);"< [2022-02-21 03:36:06,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:06,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {399#unseeded} is VALID [2022-02-21 03:36:06,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; {399#unseeded} is VALID [2022-02-21 03:36:06,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {399#unseeded} assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; {399#unseeded} is VALID [2022-02-21 03:36:06,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {399#unseeded} assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {399#unseeded} is VALID [2022-02-21 03:36:06,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {399#unseeded} call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1); {399#unseeded} is VALID [2022-02-21 03:36:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:36:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:06,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:07,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(>= oldRank0 (+ (* 2 |f_#in~v|) 1))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {434#(<= (+ f_~v 1) (div (- oldRank0) (- 2)))} is VALID [2022-02-21 03:36:07,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#(<= (+ f_~v 1) (div (- oldRank0) (- 2)))} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {438#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} is VALID [2022-02-21 03:36:07,174 INFO L272 TraceCheckUtils]: 2: Hoare triple {438#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,175 INFO L272 TraceCheckUtils]: 5: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume true; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,179 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {442#(<= |old(oldRank0)| oldRank0)} {442#(<= |old(oldRank0)| oldRank0)} #59#return; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume true; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {442#(<= |old(oldRank0)| oldRank0)} {442#(<= |old(oldRank0)| oldRank0)} #59#return; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {442#(<= |old(oldRank0)| oldRank0)} assume true; {442#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,183 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {442#(<= |old(oldRank0)| oldRank0)} {438#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} #53#return; {438#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} is VALID [2022-02-21 03:36:07,185 INFO L272 TraceCheckUtils]: 19: Hoare triple {438#(and (<= (+ f_~v 1) (div (- oldRank0) (- 2))) (not (< f_~v 0)))} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {417#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |f_#in~v|) 1))))} is VALID [2022-02-21 03:36:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:36:07,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:07,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:07,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,218 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:36:07,218 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:07,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 90 states and 107 transitions. Complement of second has 16 states. [2022-02-21 03:36:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:07,418 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:07,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:36:07,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:07,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 107 transitions. [2022-02-21 03:36:07,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:07,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,436 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 03:36:07,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:07,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:07,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,443 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:07,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 90 states and 107 transitions. cyclomatic complexity: 22 [2022-02-21 03:36:07,445 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:07,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:36:07,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:07,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:07,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:07,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:07,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:07,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:07,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:07,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 20 letters. [2022-02-21 03:36:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 20 letters. [2022-02-21 03:36:07,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 20 letters. [2022-02-21 03:36:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:36:07,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:36:07,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:36:07,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 24 letters. Loop has 20 letters. [2022-02-21 03:36:07,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:07,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:36:07,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:07,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:07,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:07,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:07,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:07,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:07,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:07,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:07,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 36 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 107 transitions. cyclomatic complexity: 22 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:07,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,477 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:36:07,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 20 letters. [2022-02-21 03:36:07,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 20 letters. [2022-02-21 03:36:07,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 40 letters. [2022-02-21 03:36:07,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 107 transitions. cyclomatic complexity: 22 [2022-02-21 03:36:07,483 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:07,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 61 states and 76 transitions. [2022-02-21 03:36:07,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 03:36:07,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-02-21 03:36:07,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2022-02-21 03:36:07,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:07,486 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-02-21 03:36:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2022-02-21 03:36:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-02-21 03:36:07,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:07,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 76 transitions. Second operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:36:07,489 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 76 transitions. Second operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:36:07,489 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:36:07,490 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:07,495 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-02-21 03:36:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-02-21 03:36:07,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:07,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:07,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 61 states and 76 transitions. [2022-02-21 03:36:07,497 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Second operand 61 states and 76 transitions. [2022-02-21 03:36:07,497 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:07,503 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2022-02-21 03:36:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2022-02-21 03:36:07,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:07,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:07,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:07,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:36:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-02-21 03:36:07,506 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-02-21 03:36:07,506 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-02-21 03:36:07,507 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:07,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. [2022-02-21 03:36:07,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:07,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:07,510 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:07,510 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 628#L76 assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 626#L76-2 assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 609#L79 call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 622#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 636#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 632#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 629#gENTRY [2022-02-21 03:36:07,510 INFO L793 eck$LassoCheckResult]: Loop: 629#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 631#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 630#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 629#gENTRY [2022-02-21 03:36:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2058005149, now seen corresponding path program 1 times [2022-02-21 03:36:07,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711578732] [2022-02-21 03:36:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,539 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 1 times [2022-02-21 03:36:07,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325906770] [2022-02-21 03:36:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,548 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash -626731559, now seen corresponding path program 1 times [2022-02-21 03:36:07,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:07,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436940260] [2022-02-21 03:36:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:07,572 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:09,811 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:09,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:09,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:09,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:09,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:09,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:09,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:09,812 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:09,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B.i_Iteration4_Lasso [2022-02-21 03:36:09,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:09,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:09,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:09,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,016 WARN L259 bleTransFormulaUtils]: 4 quantified variables [2022-02-21 03:36:10,017 WARN L259 bleTransFormulaUtils]: 4 quantified variables [2022-02-21 03:36:10,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:10,714 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:10,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,716 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:36:10,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:36:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,758 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:36:10,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,785 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 [2022-02-21 03:36:10,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,787 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:36:10,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:36:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,813 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:36:10,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,841 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 [2022-02-21 03:36:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,843 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:36:10,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:36:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,884 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:36:10,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:10,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,912 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:36:10,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,948 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 [2022-02-21 03:36:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,949 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:36:10,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:10,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:36:10,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:10,987 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:10,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:36:10,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:10,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:10,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:10,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:10,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:10,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:10,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:10,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:10,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:36:11,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,014 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:36:11,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:36:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,041 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:36:11,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,069 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:36:11,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:36:11,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,097 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) [2022-02-21 03:36:11,097 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 [2022-02-21 03:36:11,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,124 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 [2022-02-21 03:36:11,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,126 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:36:11,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,161 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:36:11,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:36:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,188 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:36:11,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:36:11,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,218 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:36:11,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:36:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,245 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:36:11,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:11,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:11,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:11,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,272 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36: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 [2022-02-21 03:36:11,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:36:11,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:36:11,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,325 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:36:11,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,364 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:36:11,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:11,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:36:11,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,396 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:36:11,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:11,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:11,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:11,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:11,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:11,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:11,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:11,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:11,422 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:36:11,422 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:36:11,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:11,423 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:11,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:36:11,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:11,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:11,431 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:11,431 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:36:11,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 03:36:11,457 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:11,460 INFO L390 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11;" "call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);"< [2022-02-21 03:36:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1052#unseeded} is VALID [2022-02-21 03:36:11,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; {1052#unseeded} is VALID [2022-02-21 03:36:11,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#unseeded} assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; {1052#unseeded} is VALID [2022-02-21 03:36:11,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {1052#unseeded} assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1052#unseeded} is VALID [2022-02-21 03:36:11,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1052#unseeded} call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1); {1052#unseeded} is VALID [2022-02-21 03:36:11,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#unseeded} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1052#unseeded} is VALID [2022-02-21 03:36:11,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#unseeded} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1052#unseeded} is VALID [2022-02-21 03:36:11,545 INFO L272 TraceCheckUtils]: 7: Hoare triple {1052#unseeded} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1052#unseeded} is VALID [2022-02-21 03:36:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:36:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-02-21 03:36:11,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {1055#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1096#(and (<= |g_#t~mem8| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| g_~p.base) g_~p.offset)) 1) oldRank0))} is VALID [2022-02-21 03:36:11,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#(and (<= |g_#t~mem8| (select (select |#memory_int| g_~p.base) g_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| g_~p.base) g_~p.offset)) 1) oldRank0))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1100#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:36:11,716 INFO L272 TraceCheckUtils]: 2: Hoare triple {1100#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1) (div (+ (- 1) oldRank0) 2)))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1070#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |g_#in~p.base|) |g_#in~p.offset|)) 1))))} is VALID [2022-02-21 03:36:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:11,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:11,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:11,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:36:11,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:11,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:11,849 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 84 transitions. Complement of second has 15 states. [2022-02-21 03:36:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:11,850 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:11,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:11,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 84 transitions. [2022-02-21 03:36:11,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:11,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,853 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 53 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:11,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:11,855 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:11,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:11,857 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:11,857 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 84 transitions. cyclomatic complexity: 20 [2022-02-21 03:36:11,858 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:11,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:36:11,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:36:11,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:36:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:36:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:36:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 44 letters. Loop has 44 letters. [2022-02-21 03:36:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:11,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:11,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:11,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:11,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 3 letters. [2022-02-21 03:36:11,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 3 letters. [2022-02-21 03:36:11,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:36:11,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 2 letters. [2022-02-21 03:36:11,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 53 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 84 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 2 letters. [2022-02-21 03:36:11,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,887 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:36:11,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:11,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:11,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 84 transitions. cyclomatic complexity: 20 [2022-02-21 03:36:11,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:11,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 54 states and 66 transitions. [2022-02-21 03:36:11,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:36:11,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:36:11,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2022-02-21 03:36:11,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:11,895 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-02-21 03:36:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2022-02-21 03:36:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-21 03:36:11,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:11,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 66 transitions. Second operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:36:11,898 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 66 transitions. Second operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:36:11,899 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:36:11,899 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:11,903 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2022-02-21 03:36:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2022-02-21 03:36:11,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:11,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:11,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) Second operand 54 states and 66 transitions. [2022-02-21 03:36:11,905 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) Second operand 54 states and 66 transitions. [2022-02-21 03:36:11,905 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:11,909 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2022-02-21 03:36:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2022-02-21 03:36:11,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:11,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:11,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:11,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (11), 6 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-21 03:36:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-02-21 03:36:11,916 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-02-21 03:36:11,916 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-02-21 03:36:11,917 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:11,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 66 transitions. [2022-02-21 03:36:11,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:11,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:11,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:11,918 INFO L791 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 1218#L76 assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 1216#L76-2 assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 1198#L79 call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 1212#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1219#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1227#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1226#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1228#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1230#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1231#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1232#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1229#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1231#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1243#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; 1244#gFINAL assume true; 1249#gEXIT >#59#return; 1235#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 1236#gFINAL assume true; 1242#gEXIT >#59#return; 1241#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 1240#gFINAL assume true; 1238#gEXIT >#53#return; 1197#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1201#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1221#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1223#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1222#gENTRY [2022-02-21 03:36:11,918 INFO L793 eck$LassoCheckResult]: Loop: 1222#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1225#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1224#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1222#gENTRY [2022-02-21 03:36:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 674903247, now seen corresponding path program 2 times [2022-02-21 03:36:11,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:11,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40502521] [2022-02-21 03:36:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:36:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:36:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,116 INFO L272 TraceCheckUtils]: 2: Hoare triple {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,119 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,121 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,123 INFO L272 TraceCheckUtils]: 2: Hoare triple {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,133 INFO L272 TraceCheckUtils]: 5: Hoare triple {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,141 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,143 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} assume true; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,145 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} {1649#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {1666#(<= f_~v 0)} is VALID [2022-02-21 03:36:12,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1647#true} is VALID [2022-02-21 03:36:12,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; {1647#true} is VALID [2022-02-21 03:36:12,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1647#true} assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; {1647#true} is VALID [2022-02-21 03:36:12,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {1647#true} assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1647#true} is VALID [2022-02-21 03:36:12,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {1647#true} call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1); {1647#true} is VALID [2022-02-21 03:36:12,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1647#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1647#true} is VALID [2022-02-21 03:36:12,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1649#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} is VALID [2022-02-21 03:36:12,147 INFO L272 TraceCheckUtils]: 7: Hoare triple {1649#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,149 INFO L272 TraceCheckUtils]: 10: Hoare triple {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,151 INFO L272 TraceCheckUtils]: 13: Hoare triple {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:36:12,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1669#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:12,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#(and (= (select (select |old(#memory_int)| g_~p.base) |g_#in~p.offset|) |g_#t~mem8|) (= |g_#in~p.base| g_~p.base))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} assume true; {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:12,154 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1689#(<= (+ (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} assume true; {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:12,156 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1687#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 0)} {1671#(and (= |g_#in~p.offset| g_~p.offset) (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ (select (select |#memory_int| g_~p.base) g_~p.offset) 1)) (= |g_#in~p.base| g_~p.base))} #59#return; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} assume true; {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:12,157 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1682#(<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) 1)} {1649#(= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset))} #53#return; {1666#(<= f_~v 0)} is VALID [2022-02-21 03:36:12,158 INFO L272 TraceCheckUtils]: 24: Hoare triple {1666#(<= f_~v 0)} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {1667#(<= (+ |f_#in~v| 1) 0)} is VALID [2022-02-21 03:36:12,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {1667#(<= (+ |f_#in~v| 1) 0)} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1668#(<= (+ f_~v 1) 0)} is VALID [2022-02-21 03:36:12,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {1668#(<= (+ f_~v 1) 0)} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1648#false} is VALID [2022-02-21 03:36:12,159 INFO L272 TraceCheckUtils]: 27: Hoare triple {1648#false} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1648#false} is VALID [2022-02-21 03:36:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:36:12,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:12,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40502521] [2022-02-21 03:36:12,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40502521] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:12,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589520619] [2022-02-21 03:36:12,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:12,161 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:12,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-02-21 03:36:12,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:12,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:12,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 45 conjunts are in the unsatisfiable core [2022-02-21 03:36:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:12,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:36:17,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-02-21 03:36:17,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:36:17,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-02-21 03:36:17,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1647#true} is VALID [2022-02-21 03:36:17,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; {1647#true} is VALID [2022-02-21 03:36:17,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1647#true} assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; {1647#true} is VALID [2022-02-21 03:36:17,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {1647#true} assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); {1647#true} is VALID [2022-02-21 03:36:17,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {1647#true} call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1); {1647#true} is VALID [2022-02-21 03:36:17,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1647#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1647#true} is VALID [2022-02-21 03:36:17,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#true} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1711#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} is VALID [2022-02-21 03:36:17,724 INFO L272 TraceCheckUtils]: 7: Hoare triple {1711#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1715#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:17,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1715#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:17,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:17,726 INFO L272 TraceCheckUtils]: 10: Hoare triple {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1715#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:17,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1715#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:17,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1670#(and (= |g_#in~p.offset| g_~p.offset) (= |#memory_int| |old(#memory_int)|) (= |g_#in~p.base| g_~p.base))} assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} is VALID [2022-02-21 03:36:17,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset); {1715#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:36:17,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {1715#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); {1738#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (<= g_~p.offset |g_#in~p.offset|) (<= (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) |g_#t~mem8|))))} is VALID [2022-02-21 03:36:17,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {1738#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (<= g_~p.offset |g_#in~p.offset|) (<= (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) |g_#t~mem8|))))} assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; {1742#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (< (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) 0) (<= g_~p.offset |g_#in~p.offset|))))} is VALID [2022-02-21 03:36:17,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {1742#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (< (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) 0) (<= g_~p.offset |g_#in~p.offset|))))} assume true; {1742#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (< (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) 0) (<= g_~p.offset |g_#in~p.offset|))))} is VALID [2022-02-21 03:36:17,732 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1742#(and (= |#memory_int| |old(#memory_int)|) (exists ((g_~p.offset Int)) (and (<= 0 g_~p.offset) (< (select (select |#memory_int| |g_#in~p.base|) g_~p.offset) 0) (<= g_~p.offset |g_#in~p.offset|))))} {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} #59#return; {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:17,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:17,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} assume true; {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} is VALID [2022-02-21 03:36:18,236 WARN L284 TraceCheckUtils]: 20: Hoare quadruple {1749#(and (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_333 1)) (= (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_333)) |#memory_int|))))} {1722#(and (= |g_#in~p.offset| g_~p.offset) (exists ((v_ArrVal_333 Int)) (and (<= (select (select |old(#memory_int)| g_~p.base) g_~p.offset) (+ v_ArrVal_333 1)) (= |#memory_int| (store |old(#memory_int)| g_~p.base (store (select |old(#memory_int)| g_~p.base) g_~p.offset v_ArrVal_333))))) (= |g_#in~p.base| g_~p.base))} #59#return; {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} is UNKNOWN [2022-02-21 03:36:18,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} is VALID [2022-02-21 03:36:18,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} assume true; {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} is VALID [2022-02-21 03:36:18,248 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1759#(and (exists ((v_ArrVal_337 Int)) (and (<= (select (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset|) (+ v_ArrVal_337 2)) (= |#memory_int| (store |old(#memory_int)| |g_#in~p.base| (store (select |old(#memory_int)| |g_#in~p.base|) |g_#in~p.offset| v_ArrVal_337))))) (exists ((v_g_~p.offset_43 Int)) (and (< (select (select |#memory_int| |g_#in~p.base|) v_g_~p.offset_43) 0) (<= v_g_~p.offset_43 |g_#in~p.offset|) (<= 0 v_g_~p.offset_43))))} {1711#(and (= 0 f_~tmp~0.offset) (<= (+ f_~v 1) (select (select |#memory_int| f_~tmp~0.base) f_~tmp~0.offset)))} #53#return; {1666#(<= f_~v 0)} is VALID [2022-02-21 03:36:18,249 INFO L272 TraceCheckUtils]: 24: Hoare triple {1666#(<= f_~v 0)} call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1); {1667#(<= (+ |f_#in~v| 1) 0)} is VALID [2022-02-21 03:36:18,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {1667#(<= (+ |f_#in~v| 1) 0)} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; {1668#(<= (+ f_~v 1) 0)} is VALID [2022-02-21 03:36:18,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {1668#(<= (+ f_~v 1) 0)} assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); {1648#false} is VALID [2022-02-21 03:36:18,251 INFO L272 TraceCheckUtils]: 27: Hoare triple {1648#false} call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset); {1648#false} is VALID [2022-02-21 03:36:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 3 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:36:18,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:19,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589520619] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:19,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:36:19,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-02-21 03:36:19,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797317713] [2022-02-21 03:36:19,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:19,439 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 2 times [2022-02-21 03:36:19,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:19,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847617560] [2022-02-21 03:36:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:19,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:19,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:36:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=362, Unknown=5, NotChecked=0, Total=420 [2022-02-21 03:36:19,680 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. cyclomatic complexity: 18 Second operand has 20 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 16 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,349 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-02-21 03:36:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:36:23,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 16 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:24,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:24,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2022-02-21 03:36:24,072 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:24,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 106 transitions. [2022-02-21 03:36:24,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-02-21 03:36:24,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-02-21 03:36:24,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 106 transitions. [2022-02-21 03:36:24,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:24,076 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-02-21 03:36:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 106 transitions. [2022-02-21 03:36:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2022-02-21 03:36:24,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:24,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states and 106 transitions. Second operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:36:24,081 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states and 106 transitions. Second operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:36:24,081 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:36:24,081 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,087 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2022-02-21 03:36:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2022-02-21 03:36:24,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Second operand 80 states and 106 transitions. [2022-02-21 03:36:24,089 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Second operand 80 states and 106 transitions. [2022-02-21 03:36:24,090 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,097 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2022-02-21 03:36:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 206 transitions. [2022-02-21 03:36:24,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:24,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-21 03:36:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-02-21 03:36:24,117 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-02-21 03:36:24,117 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-02-21 03:36:24,117 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:24,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2022-02-21 03:36:24,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-02-21 03:36:24,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,118 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:24,118 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:24,119 INFO L791 eck$LassoCheckResult]: Stem: 1902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1903#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~ret22#1.base, main_#t~ret22#1.offset, main_~p1~0#1.base, main_~p1~0#1.offset, main_~p2~0#1.base, main_~p2~0#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(4);main_~p1~0#1.base, main_~p1~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4);main_~p2~0#1.base, main_~p2~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call write~int(main_#t~nondet16#1, main_~p1~0#1.base, main_~p1~0#1.offset, 4);havoc main_#t~nondet16#1;call write~int(main_#t~nondet17#1, main_~p2~0#1.base, main_~p2~0#1.offset, 4);havoc main_#t~nondet17#1;call main_#t~mem18#1 := read~int(main_~p1~0#1.base, main_~p1~0#1.offset, 4);main_#t~short20#1 := main_#t~mem18#1 < 0; 1923#L76 assume !main_#t~short20#1;call main_#t~mem19#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1 < 0; 1918#L76-2 assume !main_#t~short20#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~short20#1;call main_#t~mem21#1 := read~int(main_~p2~0#1.base, main_~p2~0#1.offset, 4); 1900#L79 call main_#t~ret22#1.base, main_#t~ret22#1.offset := f(main_~p1~0#1.base, main_~p1~0#1.offset, main_#t~mem21#1);< 1917#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1924#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1933#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1934#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1953#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1913#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1959#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1936#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1915#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1959#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1957#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset;havoc #t~malloc9.base, #t~malloc9.offset; 1958#gFINAL assume true; 1960#gEXIT >#59#return; 1940#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 1952#gFINAL assume true; 1948#gEXIT >#59#return; 1947#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset;havoc #t~malloc13.base, #t~malloc13.offset; 1946#gFINAL assume true; 1944#gEXIT >#53#return; 1904#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1905#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1941#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset;havoc #t~malloc1.base, #t~malloc1.offset; 1942#fFINAL assume true; 1961#fEXIT >#55#return; 1901#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;havoc #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 1907#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 1922#gENTRY [2022-02-21 03:36:24,119 INFO L793 eck$LassoCheckResult]: Loop: 1922#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1935#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1909#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1922#gENTRY [2022-02-21 03:36:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1299014260, now seen corresponding path program 1 times [2022-02-21 03:36:24,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153827610] [2022-02-21 03:36:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,170 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 3 times [2022-02-21 03:36:24,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232621744] [2022-02-21 03:36:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,179 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1278507682, now seen corresponding path program 2 times [2022-02-21 03:36:24,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815673011] [2022-02-21 03:36:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,258 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:40,213 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:40,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:40,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:40,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:40,215 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:40,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:40,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:40,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:40,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B.i_Iteration6_Lasso [2022-02-21 03:36:40,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:40,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:40,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,760 WARN L259 bleTransFormulaUtils]: 10 quantified variables [2022-02-21 03:36:40,763 WARN L259 bleTransFormulaUtils]: 10 quantified variables [2022-02-21 03:36:40,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:40,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:41,085 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8