./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 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-recursive-malloc/rec_malloc_ex1.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 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:12:39,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:12:39,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:12:39,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:12:39,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:12:39,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:12:39,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:12:39,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:12:39,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:12:39,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:12:39,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:12:39,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:12:39,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:12:39,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:12:39,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:12:39,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:12:39,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:12:39,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:12:39,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:12:39,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:12:39,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:12:39,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:12:39,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:12:39,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:12:39,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:12:39,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:12:39,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:12:39,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:12:39,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:12:39,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:12:39,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:12:39,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:12:39,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:12:39,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:12:39,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:12:39,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:12:39,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:12:39,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:12:39,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:12:39,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:12:39,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:12:39,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-28 09:12:39,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:12:39,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:12:39,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:12:39,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:12:39,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:12:39,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:12:39,126 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:12:39,126 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:12:39,126 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:12:39,126 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:12:39,127 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:12:39,127 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:12:39,128 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:12:39,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:12:39,128 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:12:39,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:12:39,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:12:39,129 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:12:39,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:12:39,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:12:39,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:12:39,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:12:39,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:12:39,138 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:12:39,138 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 -> 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 [2021-12-28 09:12:39,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:12:39,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:12:39,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:12:39,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:12:39,506 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:12:39,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2021-12-28 09:12:39,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed849b84/ae3dae39b53342bfa8c0dde20dec467b/FLAG42f75b074 [2021-12-28 09:12:39,994 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:12:39,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2021-12-28 09:12:40,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed849b84/ae3dae39b53342bfa8c0dde20dec467b/FLAG42f75b074 [2021-12-28 09:12:40,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed849b84/ae3dae39b53342bfa8c0dde20dec467b [2021-12-28 09:12:40,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:12:40,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:12:40,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:12:40,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:12:40,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:12:40,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f687e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40, skipping insertion in model container [2021-12-28 09:12:40,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:12:40,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:12:40,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:12:40,545 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:12:40,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:12:40,570 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:12:40,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40 WrapperNode [2021-12-28 09:12:40,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:12:40,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:12:40,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:12:40,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:12:40,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,626 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2021-12-28 09:12:40,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:12:40,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:12:40,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:12:40,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:12:40,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:12:40,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:12:40,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:12:40,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:12:40,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (1/1) ... [2021-12-28 09:12:40,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:40,701 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-28 09:12:40,723 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-28 09:12:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 09:12:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2021-12-28 09:12:40,744 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2021-12-28 09:12:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 09:12:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:12:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:12:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 09:12:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 09:12:40,817 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:12:40,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:12:40,991 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:12:40,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:12:41,005 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:12:41,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:12:41 BoogieIcfgContainer [2021-12-28 09:12:41,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:12:41,015 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:12:41,015 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:12:41,031 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:12:41,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:12:41,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:12:40" (1/3) ... [2021-12-28 09:12:41,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71ee8c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:12:41, skipping insertion in model container [2021-12-28 09:12:41,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:12:41,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:12:40" (2/3) ... [2021-12-28 09:12:41,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71ee8c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:12:41, skipping insertion in model container [2021-12-28 09:12:41,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:12:41,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:12:41" (3/3) ... [2021-12-28 09:12:41,035 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2021-12-28 09:12:41,085 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:12:41,085 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:12:41,085 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:12:41,086 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:12:41,086 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:12:41,086 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:12:41,086 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:12:41,086 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:12:41,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 09:12:41,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:41,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:12:41,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:12:41,147 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:12:41,148 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:12:41,148 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:12:41,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 09:12:41,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:41,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:12:41,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:12:41,153 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:12:41,153 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:12:41,158 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; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 13#L28-3true [2021-12-28 09:12:41,160 INFO L793 eck$LassoCheckResult]: Loop: 13#L28-3true call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 11#L28-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 5#L31true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 12#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 16#recFINALtrue assume true; 15#recEXITtrue >#33#return; 14#L31-1true havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 13#L28-3true [2021-12-28 09:12:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2021-12-28 09:12:41,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:41,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369076141] [2021-12-28 09:12:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:41,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:41,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:41,324 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2021-12-28 09:12:41,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:41,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71424025] [2021-12-28 09:12:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:41,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:41,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:41,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2021-12-28 09:12:41,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:41,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147799699] [2021-12-28 09:12:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:41,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 09:12:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:41,682 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-28 09:12:41,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:12:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147799699] [2021-12-28 09:12:41,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147799699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:12:41,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:12:41,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 09:12:41,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348596524] [2021-12-28 09:12:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:12:42,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:12:42,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 09:12:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 09:12:42,414 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 09:12:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:12:42,515 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-12-28 09:12:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 09:12:42,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-12-28 09:12:42,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:42,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2021-12-28 09:12:42,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-28 09:12:42,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-28 09:12:42,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-28 09:12:42,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:12:42,535 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-28 09:12:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-28 09:12:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-28 09:12:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-28 09:12:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-12-28 09:12:42,567 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-28 09:12:42,567 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-28 09:12:42,567 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:12:42,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-12-28 09:12:42,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:42,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:12:42,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:12:42,570 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:12:42,570 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:12:42,571 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 66#L28-3 [2021-12-28 09:12:42,571 INFO L793 eck$LassoCheckResult]: Loop: 66#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 64#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 62#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 61#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 63#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 66#L28-3 [2021-12-28 09:12:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2021-12-28 09:12:42,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:42,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783483462] [2021-12-28 09:12:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:42,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:42,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:42,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2021-12-28 09:12:42,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:42,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254255139] [2021-12-28 09:12:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:42,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 09:12:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 09:12:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 09:12:42,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:12:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254255139] [2021-12-28 09:12:42,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254255139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:12:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982232762] [2021-12-28 09:12:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:42,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:12:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:42,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:12:42,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 09:12:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:42,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-28 09:12:42,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:42,974 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 09:12:42,975 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 1 case distinctions, treesize of input 43 treesize of output 26 [2021-12-28 09:12:43,486 WARN L860 $PredicateComparison]: unable to prove that (and (< |c_rec_#in~i| 0) (exists ((v_ArrVal_102 (Array Int Int))) (= (store |c_old(#memory_int)| |c_rec_#in~op.base| v_ArrVal_102) |c_#memory_int|))) is different from true [2021-12-28 09:12:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 09:12:43,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:12:43,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982232762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:12:43,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 09:12:43,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2021-12-28 09:12:43,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487361937] [2021-12-28 09:12:43,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 09:12:43,736 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:12:43,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:12:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 09:12:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=228, Unknown=2, NotChecked=30, Total=306 [2021-12-28 09:12:43,737 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:12:43,851 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-12-28 09:12:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 09:12:43,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-28 09:12:43,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:43,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2021-12-28 09:12:43,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-28 09:12:43,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-28 09:12:43,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-12-28 09:12:43,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:12:43,855 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-28 09:12:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-12-28 09:12:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-28 09:12:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-28 09:12:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-28 09:12:43,858 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-28 09:12:43,858 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-28 09:12:43,858 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:12:43,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-12-28 09:12:43,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:43,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:12:43,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:12:43,860 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:12:43,860 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 09:12:43,861 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 186#L28-3 [2021-12-28 09:12:43,861 INFO L793 eck$LassoCheckResult]: Loop: 186#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 181#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 178#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 179#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 177#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 180#recFINAL assume true; 183#recEXIT >#31#return; 184#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 187#recFINAL assume true; 191#recEXIT >#31#return; 189#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 190#recFINAL assume true; 188#recEXIT >#33#return; 185#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 186#L28-3 [2021-12-28 09:12:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2021-12-28 09:12:43,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:43,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320625782] [2021-12-28 09:12:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:43,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:43,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:43,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2021-12-28 09:12:43,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:43,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678275383] [2021-12-28 09:12:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:43,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 09:12:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 09:12:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 09:12:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-28 09:12:44,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:12:44,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678275383] [2021-12-28 09:12:44,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678275383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:12:44,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662135843] [2021-12-28 09:12:44,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 09:12:44,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:12:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:44,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:12:44,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 09:12:44,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 09:12:44,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:12:44,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 09:12:44,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:44,244 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 36 treesize of output 28 [2021-12-28 09:12:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 09:12:44,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:12:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 09:12:44,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662135843] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:12:44,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:12:44,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 21 [2021-12-28 09:12:44,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999048427] [2021-12-28 09:12:44,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:12:44,865 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:12:44,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:12:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-28 09:12:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-12-28 09:12:44,867 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 7 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-28 09:12:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:12:44,992 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-12-28 09:12:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 09:12:44,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-12-28 09:12:44,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:44,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2021-12-28 09:12:44,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-28 09:12:44,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-28 09:12:44,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-12-28 09:12:44,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:12:44,996 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-28 09:12:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-12-28 09:12:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-28 09:12:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 09:12:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-28 09:12:44,999 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-28 09:12:44,999 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-28 09:12:44,999 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:12:44,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2021-12-28 09:12:45,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-28 09:12:45,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:12:45,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:12:45,001 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-28 09:12:45,001 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-28 09:12:45,002 INFO L791 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 399#L28-3 [2021-12-28 09:12:45,002 INFO L793 eck$LassoCheckResult]: Loop: 399#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 394#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 391#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 392#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 395#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 390#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 393#recFINAL assume true; 396#recEXIT >#31#return; 397#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 400#recFINAL assume true; 407#recEXIT >#31#return; 406#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 405#recFINAL assume true; 404#recEXIT >#31#return; 402#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 403#recFINAL assume true; 401#recEXIT >#33#return; 398#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 399#L28-3 [2021-12-28 09:12:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2021-12-28 09:12:45,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581189157] [2021-12-28 09:12:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:45,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,017 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2021-12-28 09:12:45,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574468579] [2021-12-28 09:12:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:45,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,075 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2021-12-28 09:12:45,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:12:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378790151] [2021-12-28 09:12:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:12:45,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:12:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:12:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:12:45,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:12:48,426 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:12:48,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:12:48,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:12:48,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:12:48,426 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:12:48,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:48,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:12:48,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:12:48,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2021-12-28 09:12:48,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:12:48,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:12:48,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:12:48,692 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-28 09:12:48,703 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-28 09:12:48,705 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-28 09:12:48,707 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-28 09:12:48,708 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-28 09:12:48,710 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-28 09:12:48,712 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-28 09:12:48,713 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-28 09:12:48,714 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-28 09:12:48,716 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-28 09:12:48,717 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-28 09:12:48,720 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-28 09:12:48,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:12:48,724 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-28 09:12:49,083 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:12:49,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:12:49,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:49,092 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-28 09:12:49,095 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-28 09:12:49,096 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-28 09:12:49,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:12:49,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:12:49,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:12:49,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:12:49,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:12:49,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:12:49,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:12:49,146 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-28 09:12:49,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:49,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:49,148 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-28 09:12:49,156 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-28 09:12:49,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:12:49,164 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2021-12-28 09:12:49,164 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2021-12-28 09:12:49,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:12:49,198 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-28 09:12:49,295 INFO L401 nArgumentSynthesizer]: We have 208 Motzkin's Theorem applications. [2021-12-28 09:12:49,295 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2021-12-28 09:12:49,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:12:49,513 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-28 09:12:49,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:49,515 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-28 09:12:49,516 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-28 09:12:49,521 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-28 09:12:49,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:12:49,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:12:49,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:12:49,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:12:49,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:12:49,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:12:49,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:12:49,582 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-28 09:12:49,582 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-28 09:12:49,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:12:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:12:49,603 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-28 09:12:49,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:12:49,646 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-28 09:12:49,656 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-28 09:12:49,657 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:12:49,657 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2021-12-28 09:12:49,680 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-28 09:12:49,705 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2021-12-28 09:12:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:49,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:12:49,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:49,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-28 09:12:49,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:49,870 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-28 09:12:49,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2021-12-28 09:12:49,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 14 [2021-12-28 09:12:49,895 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 12 treesize of output 11 [2021-12-28 09:12:49,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:49,927 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 19 treesize of output 15 [2021-12-28 09:12:49,931 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 9 treesize of output 7 [2021-12-28 09:12:49,944 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 21 treesize of output 13 [2021-12-28 09:12:50,263 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-28 09:12:50,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:50,752 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-28 09:12:50,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2021-12-28 09:12:50,802 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-28 09:12:50,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 80 [2021-12-28 09:12:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 19 refuted. 4 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-28 09:12:50,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2021-12-28 09:12:50,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:50,938 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2021-12-28 09:12:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-28 09:12:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2021-12-28 09:12:50,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-28 09:12:50,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:12:50,942 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:12:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:50,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:12:50,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:51,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-28 09:12:51,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:51,086 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-28 09:12:51,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2021-12-28 09:12:51,092 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-28 09:12:51,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 18 [2021-12-28 09:12:51,123 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 11 treesize of output 7 [2021-12-28 09:12:51,140 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 28 treesize of output 22 [2021-12-28 09:12:51,145 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 17 treesize of output 13 [2021-12-28 09:12:51,482 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 6 treesize of output 5 [2021-12-28 09:12:51,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:51,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-28 09:12:51,815 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:12:51,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-28 09:12:52,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:52,258 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-28 09:12:52,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2021-12-28 09:12:52,299 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-28 09:12:52,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 80 [2021-12-28 09:12:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 21 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-28 09:12:52,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 18 loop predicates [2021-12-28 09:12:52,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:52,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2021-12-28 09:12:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-28 09:12:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 13 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2021-12-28 09:12:52,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-28 09:12:52,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:12:52,474 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:12:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:52,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:12:52,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:52,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-28 09:12:52,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:52,612 INFO L353 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2021-12-28 09:12:52,612 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 69 treesize of output 66 [2021-12-28 09:12:52,642 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-28 09:12:52,642 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 48 treesize of output 74 [2021-12-28 09:12:52,650 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-28 09:12:52,674 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 21 treesize of output 17 [2021-12-28 09:12:52,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 37 [2021-12-28 09:12:52,750 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 42 treesize of output 38 [2021-12-28 09:12:52,759 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 9 treesize of output 7 [2021-12-28 09:12:52,817 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 42 treesize of output 32 [2021-12-28 09:12:52,821 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 17 treesize of output 13 [2021-12-28 09:12:53,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:53,590 INFO L353 Elim1Store]: treesize reduction 41, result has 34.9 percent of original size [2021-12-28 09:12:53,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 75 [2021-12-28 09:12:53,641 INFO L353 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2021-12-28 09:12:53,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 150 [2021-12-28 09:12:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 09:12:53,737 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2021-12-28 09:12:53,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 09:12:53,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 28 states and 32 transitions. Complement of second has 9 states. [2021-12-28 09:12:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-28 09:12:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-28 09:12:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2021-12-28 09:12:53,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-28 09:12:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:12:53,794 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:12:53,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:53,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:12:53,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:53,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-28 09:12:53,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:53,920 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-28 09:12:53,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2021-12-28 09:12:53,926 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-28 09:12:53,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 18 [2021-12-28 09:12:53,950 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 11 treesize of output 7 [2021-12-28 09:12:53,976 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 28 treesize of output 22 [2021-12-28 09:12:53,979 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 17 treesize of output 13 [2021-12-28 09:12:54,256 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 6 treesize of output 5 [2021-12-28 09:12:54,353 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:12:54,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-28 09:12:54,644 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:12:54,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-28 09:12:55,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:55,322 INFO L353 Elim1Store]: treesize reduction 53, result has 47.5 percent of original size [2021-12-28 09:12:55,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 65 [2021-12-28 09:12:55,357 INFO L353 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-28 09:12:55,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-28 09:12:55,371 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 7 treesize of output 5 [2021-12-28 09:12:55,418 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 5 treesize of output 3 [2021-12-28 09:12:55,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:12:55,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2021-12-28 09:12:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 09:12:55,754 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 19 loop predicates [2021-12-28 09:12:55,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:55,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 29 states and 33 transitions. Complement of second has 11 states. [2021-12-28 09:12:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-28 09:12:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2021-12-28 09:12:55,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-28 09:12:55,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:12:55,819 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:12:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:12:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:55,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:12:55,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:12:55,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-28 09:12:55,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:12:55,956 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-28 09:12:55,956 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 68 treesize of output 69 [2021-12-28 09:12:55,983 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-28 09:12:55,983 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 72 [2021-12-28 09:12:55,990 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-28 09:12:56,004 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 17 treesize of output 15 [2021-12-28 09:12:56,141 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 20 treesize of output 16 [2021-12-28 09:12:56,170 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 12 treesize of output 10 [2021-12-28 09:12:56,207 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 36 treesize of output 28 [2021-12-28 09:12:56,218 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 18 treesize of output 14 [2021-12-28 09:12:56,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2021-12-28 09:12:56,568 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 6 treesize of output 5 [2021-12-28 09:12:56,663 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:12:56,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-28 09:12:56,980 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:12:56,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-28 09:12:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:57,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 09:12:57,631 INFO L353 Elim1Store]: treesize reduction 53, result has 47.5 percent of original size [2021-12-28 09:12:57,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 83 [2021-12-28 09:12:57,666 INFO L353 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2021-12-28 09:12:57,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 45 [2021-12-28 09:12:57,695 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 7 treesize of output 5 [2021-12-28 09:12:57,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:12:57,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-28 09:12:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 24 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 09:12:58,015 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 19 loop predicates [2021-12-28 09:12:58,016 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:58,163 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 109 states and 139 transitions. Complement of second has 58 states 11 powerset states47 rank states. The highest rank that occured is 7 [2021-12-28 09:12:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2021-12-28 09:12:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 09:12:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2021-12-28 09:12:58,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 2 letters. Loop has 26 letters. [2021-12-28 09:12:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:12:58,166 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-28 09:12:58,167 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) 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-28 09:12:58,170 INFO L158 Benchmark]: Toolchain (without parser) took 17772.80ms. Allocated memory was 50.3MB in the beginning and 142.6MB in the end (delta: 92.3MB). Free memory was 28.3MB in the beginning and 56.1MB in the end (delta: -27.8MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2021-12-28 09:12:58,170 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 33.1MB in the beginning and 33.1MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:12:58,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.75ms. Allocated memory is still 50.3MB. Free memory was 28.2MB in the beginning and 30.5MB in the end (delta: -2.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-12-28 09:12:58,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.78ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 48.7MB in the end (delta: -18.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 09:12:58,170 INFO L158 Benchmark]: Boogie Preprocessor took 36.40ms. Allocated memory is still 65.0MB. Free memory was 48.7MB in the beginning and 47.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:12:58,171 INFO L158 Benchmark]: RCFGBuilder took 347.96ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 36.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 09:12:58,171 INFO L158 Benchmark]: BuchiAutomizer took 17154.55ms. Allocated memory was 65.0MB in the beginning and 142.6MB in the end (delta: 77.6MB). Free memory was 36.7MB in the beginning and 56.1MB in the end (delta: -19.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2021-12-28 09:12:58,172 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.22ms. Allocated memory is still 50.3MB. Free memory was 33.1MB in the beginning and 33.1MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.75ms. Allocated memory is still 50.3MB. Free memory was 28.2MB in the beginning and 30.5MB in the end (delta: -2.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.78ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 48.7MB in the end (delta: -18.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.40ms. Allocated memory is still 65.0MB. Free memory was 48.7MB in the beginning and 47.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.96ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 36.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 17154.55ms. Allocated memory was 65.0MB in the beginning and 142.6MB in the end (delta: 77.6MB). Free memory was 36.7MB in the beginning and 56.1MB in the end (delta: -19.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 09:12:58,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 09:12:58,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 09:12:58,600 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: AssertionError: no settings was sufficient