./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 19:53:44,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 19:53:44,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 19:53:44,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 19:53:44,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 19:53:44,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 19:53:44,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 19:53:44,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 19:53:44,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 19:53:44,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 19:53:44,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 19:53:44,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 19:53:44,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 19:53:44,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 19:53:44,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 19:53:44,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 19:53:44,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 19:53:44,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 19:53:44,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 19:53:44,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 19:53:44,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 19:53:44,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 19:53:44,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 19:53:44,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 19:53:44,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 19:53:44,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 19:53:44,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 19:53:44,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 19:53:44,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 19:53:44,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 19:53:44,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 19:53:44,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 19:53:44,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 19:53:44,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 19:53:44,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 19:53:44,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 19:53:44,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 19:53:44,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 19:53:44,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 19:53:44,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 19:53:44,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 19:53:44,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-22 19:53:44,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 19:53:44,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 19:53:44,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 19:53:44,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 19:53:44,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 19:53:44,282 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 19:53:44,282 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 19:53:44,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 19:53:44,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 19:53:44,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 19:53:44,284 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 19:53:44,284 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 19:53:44,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 19:53:44,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 19:53:44,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 19:53:44,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 19:53:44,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 19:53:44,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 19:53:44,285 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 19:53:44,285 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 -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2021-12-22 19:53:44,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 19:53:44,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 19:53:44,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 19:53:44,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 19:53:44,477 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 19:53:44,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-12-22 19:53:44,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991313cbf/ac63a6a0b69c4a3193fabcab78f15983/FLAG97b65f41e [2021-12-22 19:53:44,852 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 19:53:44,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-12-22 19:53:44,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991313cbf/ac63a6a0b69c4a3193fabcab78f15983/FLAG97b65f41e [2021-12-22 19:53:45,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991313cbf/ac63a6a0b69c4a3193fabcab78f15983 [2021-12-22 19:53:45,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 19:53:45,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 19:53:45,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 19:53:45,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 19:53:45,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 19:53:45,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17eab4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45, skipping insertion in model container [2021-12-22 19:53:45,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 19:53:45,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 19:53:45,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:53:45,587 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 19:53:45,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 19:53:45,637 INFO L208 MainTranslator]: Completed translation [2021-12-22 19:53:45,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45 WrapperNode [2021-12-22 19:53:45,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 19:53:45,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 19:53:45,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 19:53:45,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 19:53:45,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,685 INFO L137 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2021-12-22 19:53:45,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 19:53:45,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 19:53:45,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 19:53:45,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 19:53:45,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 19:53:45,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 19:53:45,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 19:53:45,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 19:53:45,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (1/1) ... [2021-12-22 19:53:45,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:45,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 19:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 19:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 19:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 19:53:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 19:53:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 19:53:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 19:53:45,855 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 19:53:45,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 19:53:46,025 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 19:53:46,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 19:53:46,029 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-22 19:53:46,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:53:46 BoogieIcfgContainer [2021-12-22 19:53:46,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 19:53:46,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 19:53:46,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 19:53:46,034 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 19:53:46,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:53:46,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 07:53:45" (1/3) ... [2021-12-22 19:53:46,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@673b0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:53:46, skipping insertion in model container [2021-12-22 19:53:46,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:53:46,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:53:45" (2/3) ... [2021-12-22 19:53:46,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@673b0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 07:53:46, skipping insertion in model container [2021-12-22 19:53:46,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 19:53:46,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:53:46" (3/3) ... [2021-12-22 19:53:46,037 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2021-12-22 19:53:46,073 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 19:53:46,073 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 19:53:46,074 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 19:53:46,074 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 19:53:46,074 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 19:53:46,074 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 19:53:46,074 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 19:53:46,074 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 19:53:46,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:46,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:46,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:46,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:46,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:53:46,101 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 19:53:46,101 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 19:53:46,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:46,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:46,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:46,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:46,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 19:53:46,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 19:53:46,108 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 5#L552-3true [2021-12-22 19:53:46,108 INFO L793 eck$LassoCheckResult]: Loop: 5#L552-3true goto; 8#L554-1true call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10#L552-1true assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11#L554true assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 5#L552-3true [2021-12-22 19:53:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-22 19:53:46,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077013753] [2021-12-22 19:53:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2021-12-22 19:53:46,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235519463] [2021-12-22 19:53:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2021-12-22 19:53:46,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680860777] [2021-12-22 19:53:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:46,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:53:46,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680860777] [2021-12-22 19:53:46,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680860777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 19:53:46,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 19:53:46,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 19:53:46,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095924282] [2021-12-22 19:53:46,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 19:53:46,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:53:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 19:53:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 19:53:46,532 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:53:46,550 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-12-22 19:53:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 19:53:46,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-12-22 19:53:46,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:46,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2021-12-22 19:53:46,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-22 19:53:46,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-22 19:53:46,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-12-22 19:53:46,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 19:53:46,558 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-22 19:53:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-12-22 19:53:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-22 19:53:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-22 19:53:46,573 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-22 19:53:46,573 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-22 19:53:46,573 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 19:53:46,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-12-22 19:53:46,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:46,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:46,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:46,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 19:53:46,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 19:53:46,574 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 41#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 42#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2021-12-22 19:53:46,574 INFO L793 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 46#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 44#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 43#L554-1 [2021-12-22 19:53:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2021-12-22 19:53:46,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551291084] [2021-12-22 19:53:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2021-12-22 19:53:46,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358318690] [2021-12-22 19:53:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,613 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2021-12-22 19:53:46,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758188675] [2021-12-22 19:53:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:46,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:46,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:46,934 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:53:46,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:53:46,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:53:46,935 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:53:46,935 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:53:46,935 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:46,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:53:46,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:53:46,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2021-12-22 19:53:46,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:53:46,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:53:46,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:46,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:46,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:47,357 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 19:53:47,360 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 19:53:47,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-22 19:53:47,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:53:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:53:47,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:53:47,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-22 19:53:47,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 19:53:47,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 19:53:47,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 19:53:47,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-22 19:53:47,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-22 19:53:47,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-22 19:53:47,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-22 19:53:47,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 [2021-12-22 19:53:47,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-22 19:53:47,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 19:53:47,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-22 19:53:47,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 19:53:47,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 19:53:47,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 19:53:47,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 19:53:47,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 19:53:47,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 19:53:47,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 19:53:47,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 19:53:47,851 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-22 19:53:47,851 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-12-22 19:53:47,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:47,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:47,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 19:53:47,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-22 19:53:47,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 19:53:47,922 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 19:53:47,922 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 19:53:47,923 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2021-12-22 19:53:47,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:47,964 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2021-12-22 19:53:47,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:47,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 19:53:47,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:53:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:48,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 19:53:48,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:53:48,046 INFO L387 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 32 treesize of output 20 [2021-12-22 19:53:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:48,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-22 19:53:48,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:48,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2021-12-22 19:53:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-22 19:53:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-22 19:53:48,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2021-12-22 19:53:48,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:53:48,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-12-22 19:53:48,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:53:48,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2021-12-22 19:53:48,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 19:53:48,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2021-12-22 19:53:48,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:48,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2021-12-22 19:53:48,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-22 19:53:48,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-22 19:53:48,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-12-22 19:53:48,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 19:53:48,096 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-22 19:53:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-12-22 19:53:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-12-22 19:53:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-12-22 19:53:48,098 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-22 19:53:48,098 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-22 19:53:48,098 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 19:53:48,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-12-22 19:53:48,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:48,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:48,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:48,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2021-12-22 19:53:48,099 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 19:53:48,099 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 162#L552-3 goto; 169#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 168#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 167#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 166#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 160#L552-1 [2021-12-22 19:53:48,099 INFO L793 eck$LassoCheckResult]: Loop: 160#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 163#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 154#L552-3 goto; 155#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 160#L552-1 [2021-12-22 19:53:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2021-12-22 19:53:48,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130423654] [2021-12-22 19:53:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2021-12-22 19:53:48,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514768659] [2021-12-22 19:53:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,131 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2021-12-22 19:53:48,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71284948] [2021-12-22 19:53:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:48,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:53:48,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71284948] [2021-12-22 19:53:48,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71284948] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:53:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499032257] [2021-12-22 19:53:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:53:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:48,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 19:53:48,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 19:53:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:48,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 19:53:48,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:53:48,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:48,330 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-22 19:53:48,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2021-12-22 19:53:48,352 INFO L353 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2021-12-22 19:53:48,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2021-12-22 19:53:48,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-22 19:53:48,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-22 19:53:48,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-22 19:53:48,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-22 19:53:48,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2021-12-22 19:53:48,494 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 19:53:48,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-22 19:53:48,517 INFO L387 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 17 treesize of output 9 [2021-12-22 19:53:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:48,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:53:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:48,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499032257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 19:53:48,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 19:53:48,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2021-12-22 19:53:48,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275167846] [2021-12-22 19:53:48,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 19:53:48,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:53:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 19:53:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-22 19:53:48,627 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:53:48,685 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-12-22 19:53:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 19:53:48,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2021-12-22 19:53:48,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:48,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2021-12-22 19:53:48,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-22 19:53:48,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-22 19:53:48,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-12-22 19:53:48,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 19:53:48,688 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-12-22 19:53:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-12-22 19:53:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-22 19:53:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-12-22 19:53:48,692 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-12-22 19:53:48,692 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-12-22 19:53:48,692 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 19:53:48,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2021-12-22 19:53:48,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:48,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:48,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:48,695 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2021-12-22 19:53:48,695 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 19:53:48,695 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 286#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 295#L552-3 goto; 304#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 303#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 299#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 291#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 292#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 298#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 293#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 294#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 308#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 307#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 306#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 305#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 301#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 [2021-12-22 19:53:48,696 INFO L793 eck$LassoCheckResult]: Loop: 296#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 287#L552-3 goto; 288#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 296#L552-1 [2021-12-22 19:53:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 4 times [2021-12-22 19:53:48,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90645824] [2021-12-22 19:53:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2021-12-22 19:53:48,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991404218] [2021-12-22 19:53:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:48,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 2 times [2021-12-22 19:53:48,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604732509] [2021-12-22 19:53:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:48,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 19:53:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:48,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 19:53:48,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604732509] [2021-12-22 19:53:48,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604732509] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 19:53:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249570965] [2021-12-22 19:53:48,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 19:53:48,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 19:53:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 19:53:48,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 19:53:48,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 19:53:49,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 19:53:49,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 19:53:49,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-22 19:53:49,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 19:53:49,050 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-22 19:53:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 19:53:49,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-22 19:53:49,057 INFO L387 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 10 treesize of output 8 [2021-12-22 19:53:49,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-22 19:53:49,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-22 19:53:49,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-22 19:53:49,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-22 19:53:49,156 INFO L387 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 17 treesize of output 9 [2021-12-22 19:53:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:49,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 19:53:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 19:53:49,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249570965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 19:53:49,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 19:53:49,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2021-12-22 19:53:49,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965600425] [2021-12-22 19:53:49,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 19:53:49,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 19:53:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 19:53:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=382, Unknown=0, NotChecked=0, Total=600 [2021-12-22 19:53:49,374 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 19:53:49,489 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2021-12-22 19:53:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-22 19:53:49,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2021-12-22 19:53:49,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:49,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 44 transitions. [2021-12-22 19:53:49,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-22 19:53:49,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-22 19:53:49,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2021-12-22 19:53:49,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 19:53:49,491 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-12-22 19:53:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2021-12-22 19:53:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-22 19:53:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 19:53:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2021-12-22 19:53:49,493 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-12-22 19:53:49,493 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-12-22 19:53:49,493 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 19:53:49,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2021-12-22 19:53:49,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-22 19:53:49,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 19:53:49,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 19:53:49,494 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2021-12-22 19:53:49,494 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-22 19:53:49,495 INFO L791 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem4#1, main_#t~mem10#1, main_~i~0#1.base, main_~i~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4); 527#L552-3 goto; 537#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 536#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 531#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 523#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 524#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 558#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 525#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 526#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 530#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 532#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 557#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 556#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 555#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 554#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 553#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 552#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 551#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 550#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 549#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 548#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 547#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 546#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 545#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 544#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 543#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 541#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 540#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 538#L554 assume main_#t~mem7#1 <= 10;havoc main_#t~mem7#1; 534#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 528#L552-1 [2021-12-22 19:53:49,495 INFO L793 eck$LassoCheckResult]: Loop: 528#L552-1 assume !!(main_#t~mem4#1 < 20);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1;call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 529#L554 assume !(main_#t~mem7#1 <= 10);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post9#1 := main_#t~mem8#1;call write~int(1 + main_#t~post9#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~post9#1; 517#L552-3 goto; 518#L554-1 call main_#t~mem4#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 528#L552-1 [2021-12-22 19:53:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 5 times [2021-12-22 19:53:49,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:49,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952065] [2021-12-22 19:53:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:49,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2021-12-22 19:53:49,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:49,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097599137] [2021-12-22 19:53:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:49,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,580 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 19:53:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 3 times [2021-12-22 19:53:49,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 19:53:49,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237277270] [2021-12-22 19:53:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 19:53:49,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 19:53:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 19:53:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 19:53:49,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 19:53:56,407 WARN L227 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 203 DAG size of output: 165 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-22 19:53:56,503 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 19:53:56,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 19:53:56,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 19:53:56,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 19:53:56,504 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 19:53:56,504 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 19:53:56,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 19:53:56,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 19:53:56,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration5_Lasso [2021-12-22 19:53:56,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 19:53:56,504 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 19:53:56,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 19:53:56,654 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-22 19:53:56,656 INFO L158 Benchmark]: Toolchain (without parser) took 11356.64ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 49.0MB in the beginning and 115.9MB in the end (delta: -66.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,656 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 19:53:56,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.90ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 54.0MB in the end (delta: -5.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 81.8MB. Free memory was 53.8MB in the beginning and 52.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,657 INFO L158 Benchmark]: Boogie Preprocessor took 36.48ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 51.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,657 INFO L158 Benchmark]: RCFGBuilder took 308.05ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 50.9MB in the beginning and 75.6MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,657 INFO L158 Benchmark]: BuchiAutomizer took 10623.65ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 75.5MB in the beginning and 115.9MB in the end (delta: -40.5MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2021-12-22 19:53:56,658 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.90ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 54.0MB in the end (delta: -5.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 81.8MB. Free memory was 53.8MB in the beginning and 52.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.48ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 51.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 308.05ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 50.9MB in the beginning and 75.6MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10623.65ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 75.5MB in the beginning and 115.9MB in the end (delta: -40.5MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-22 19:53:56,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:56,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 19:53:57,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null