./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:04:03,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:04:03,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:04:03,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:04:03,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:04:03,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:04:03,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:04:03,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:04:03,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:04:03,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:04:03,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:04:03,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:04:03,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:04:03,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:04:03,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:04:03,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:04:03,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:04:03,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:04:03,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:04:03,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:04:03,740 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:04:03,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:04:03,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:04:03,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:04:03,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:04:03,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:04:03,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:04:03,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:04:03,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:04:03,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:04:03,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:04:03,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:04:03,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:04:03,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:04:03,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:04:03,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:04:03,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:04:03,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:04:03,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:04:03,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:04:03,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:04:03,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:04:03,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:04:03,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:04:03,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:04:03,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:04:03,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:04:03,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:04:03,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:04:03,793 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:04:03,793 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:04:03,793 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:04:03,794 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:04:03,794 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:04:03,794 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:04:03,794 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:04:03,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:04:03,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:04:03,795 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:04:03,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:04:03,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:04:03,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:04:03,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:04:03,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:04:03,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:04:03,798 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:04:03,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:04:03,798 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:04:03,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:04:03,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:04:03,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:04:03,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:04:03,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:04:03,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:04:03,800 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:04:03,801 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 870a7e5617be5a547f8d530603b5c27ad6cbb74bb05a83654285fee7bbb92753 [2022-07-23 16:04:04,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:04:04,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:04:04,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:04:04,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:04:04,081 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:04:04,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2022-07-23 16:04:04,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c5c214d/06869fef0ebf4c8c8dddcb64e4eb744c/FLAGe731e34e6 [2022-07-23 16:04:04,602 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:04:04,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2022-07-23 16:04:04,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c5c214d/06869fef0ebf4c8c8dddcb64e4eb744c/FLAGe731e34e6 [2022-07-23 16:04:04,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c5c214d/06869fef0ebf4c8c8dddcb64e4eb744c [2022-07-23 16:04:04,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:04:04,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:04:04,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:04:04,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:04:04,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:04:04,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:04:04" (1/1) ... [2022-07-23 16:04:04,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2325d4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:04, skipping insertion in model container [2022-07-23 16:04:04,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:04:04" (1/1) ... [2022-07-23 16:04:04,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:04:05,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:04:05,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:04:05,226 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:04:05,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:04:05,295 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:04:05,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05 WrapperNode [2022-07-23 16:04:05,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:04:05,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:04:05,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:04:05,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:04:05,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,328 INFO L137 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-23 16:04:05,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:04:05,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:04:05,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:04:05,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:04:05,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:04:05,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:04:05,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:04:05,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:04:05,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (1/1) ... [2022-07-23 16:04:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:05,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:04:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:04:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:04:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:04:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:04:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:04:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:04:05,479 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:04:05,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:04:05,564 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:04:05,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:04:05,569 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 16:04:05,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:04:05 BoogieIcfgContainer [2022-07-23 16:04:05,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:04:05,572 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:04:05,572 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:04:05,574 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:04:05,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:05,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:04:04" (1/3) ... [2022-07-23 16:04:05,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a9524a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:04:05, skipping insertion in model container [2022-07-23 16:04:05,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:05,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:04:05" (2/3) ... [2022-07-23 16:04:05,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a9524a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:04:05, skipping insertion in model container [2022-07-23 16:04:05,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:04:05,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:04:05" (3/3) ... [2022-07-23 16:04:05,578 INFO L354 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2022-07-23 16:04:05,620 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:04:05,621 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:04:05,621 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:04:05,621 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:04:05,621 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:04:05,621 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:04:05,621 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:04:05,622 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:04:05,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:05,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 16:04:05,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:05,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:05,646 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 16:04:05,647 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:05,647 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:04:05,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:05,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 16:04:05,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:05,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:05,649 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 16:04:05,649 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:05,654 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10#L515true assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 7#L515-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 13#L517true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 5#L520-3true [2022-07-23 16:04:05,655 INFO L754 eck$LassoCheckResult]: Loop: 5#L520-3true assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 11#L520-2true main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5#L520-3true [2022-07-23 16:04:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-07-23 16:04:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:05,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186512316] [2022-07-23 16:04:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2022-07-23 16:04:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961350130] [2022-07-23 16:04:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2022-07-23 16:04:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122360272] [2022-07-23 16:04:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:05,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:06,282 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:06,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:06,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:06,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:06,284 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:06,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:06,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:06,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2022-07-23 16:04:06,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:06,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:06,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:06,796 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:04:06,799 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:04:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:06,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:06,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:06,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:06,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:06,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:06,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:06,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:06,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:06,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:06,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 16:04:06,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:06,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:06,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:06,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:06,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 16:04:06,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:06,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:06,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:06,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:06,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:06,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:06,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:06,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:06,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:06,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:06,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:06,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:06,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 16:04:06,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:06,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:06,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:04:06,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:06,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:06,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:06,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:04:06,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:04:06,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:06,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-23 16:04:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:06,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:06,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 16:04:06,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:06,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:06,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:06,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:06,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:06,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:06,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:06,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:06,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-23 16:04:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:06,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:06,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:06,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 16:04:06,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:06,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:06,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:06,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:06,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:07,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:07,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:07,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:04:07,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:07,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:07,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:07,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 16:04:07,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:04:07,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:04:07,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:04:07,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:04:07,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:04:07,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:04:07,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:04:07,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:04:07,127 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-23 16:04:07,128 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-23 16:04:07,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:07,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:07,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:04:07,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 16:04:07,188 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:04:07,203 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:04:07,203 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:04:07,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-07-23 16:04:07,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:07,233 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-23 16:04:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:07,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:04:07,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:07,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:04:07,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:04:07,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-23 16:04:07,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:04:07,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:07,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 7 states. [2022-07-23 16:04:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:04:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-07-23 16:04:07,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-23 16:04:07,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:07,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-23 16:04:07,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:07,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-23 16:04:07,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:04:07,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-07-23 16:04:07,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:07,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2022-07-23 16:04:07,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 16:04:07,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 16:04:07,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-07-23 16:04:07,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:07,445 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-23 16:04:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-07-23 16:04:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-23 16:04:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-23 16:04:07,462 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-23 16:04:07,462 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-23 16:04:07,462 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:04:07,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-07-23 16:04:07,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:07,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:07,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:07,464 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:04:07,464 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:07,464 INFO L752 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 113#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 111#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 112#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 108#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 105#L525-2 [2022-07-23 16:04:07,464 INFO L754 eck$LassoCheckResult]: Loop: 105#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 104#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 105#L525-2 [2022-07-23 16:04:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2022-07-23 16:04:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269094826] [2022-07-23 16:04:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:04:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269094826] [2022-07-23 16:04:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269094826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:04:07,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:04:07,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:04:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512400485] [2022-07-23 16:04:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:04:07,511 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:04:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2022-07-23 16:04:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:07,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65118307] [2022-07-23 16:04:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 16:04:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 16:04:07,610 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:07,638 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-07-23 16:04:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 16:04:07,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-07-23 16:04:07,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:07,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2022-07-23 16:04:07,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 16:04:07,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-23 16:04:07,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-07-23 16:04:07,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:07,640 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-07-23 16:04:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-07-23 16:04:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-23 16:04:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-07-23 16:04:07,642 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-07-23 16:04:07,642 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-07-23 16:04:07,642 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:04:07,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-07-23 16:04:07,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:07,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:07,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:07,643 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:07,644 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:07,644 INFO L752 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 141#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 139#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 140#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 136#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 137#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 138#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 133#L525-2 [2022-07-23 16:04:07,644 INFO L754 eck$LassoCheckResult]: Loop: 133#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 132#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 133#L525-2 [2022-07-23 16:04:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2022-07-23 16:04:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633824379] [2022-07-23 16:04:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2022-07-23 16:04:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029015292] [2022-07-23 16:04:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:07,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:07,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2022-07-23 16:04:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:07,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275616625] [2022-07-23 16:04:07,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:04:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:04:08,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275616625] [2022-07-23 16:04:08,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275616625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:04:08,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192307608] [2022-07-23 16:04:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:08,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:04:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:04:08,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:04:08,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 16:04:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:04:08,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 16:04:08,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:04:08,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-23 16:04:08,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 16:04:08,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 16:04:08,278 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-07-23 16:04:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:04:08,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:04:08,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 16:04:08,354 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2022-07-23 16:04:08,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-23 16:04:08,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 16:04:08,395 INFO L390 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 106 treesize of output 101 [2022-07-23 16:04:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:04:08,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192307608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:04:08,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:04:08,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-07-23 16:04:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786250197] [2022-07-23 16:04:08,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:04:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:04:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 16:04:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-07-23 16:04:08,543 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:04:08,661 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-07-23 16:04:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 16:04:08,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-07-23 16:04:08,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:08,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2022-07-23 16:04:08,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-23 16:04:08,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-23 16:04:08,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2022-07-23 16:04:08,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:04:08,664 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-23 16:04:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2022-07-23 16:04:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-07-23 16:04:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:04:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-07-23 16:04:08,665 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-23 16:04:08,666 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-23 16:04:08,666 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:04:08,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-07-23 16:04:08,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 16:04:08,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:04:08,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:04:08,667 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 16:04:08,667 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:04:08,667 INFO L752 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_~k~0#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post10#1.base, main_#t~post10#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 249#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 247#L515-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 248#L517 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~a~0#1.base, main_~a~0#1.offset := main_~arr~0#1.base, main_~arr~0#1.offset;main_~k~0#1 := 0; 243#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 244#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 245#L520-3 assume !!(main_~k~0#1 < main_~length~0#1);call write~int(main_#t~nondet5#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet5#1; 246#L520-2 main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 250#L520-3 assume !(main_~k~0#1 < main_~length~0#1); 240#L525-2 [2022-07-23 16:04:08,667 INFO L754 eck$LassoCheckResult]: Loop: 240#L525-2 call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4); 239#L525 assume !!(main_#t~mem6#1 != main_#t~mem7#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~length~0#1 - 4, 4);call write~int(main_#t~mem8#1 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~post10#1.base, main_#t~post10#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~a~0#1.base, main_~a~0#1.offset := main_#t~post10#1.base, 4 + main_#t~post10#1.offset;havoc main_#t~post10#1.base, main_#t~post10#1.offset; 240#L525-2 [2022-07-23 16:04:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2022-07-23 16:04:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356569827] [2022-07-23 16:04:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2022-07-23 16:04:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:08,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253391093] [2022-07-23 16:04:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:04:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2022-07-23 16:04:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:04:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30993861] [2022-07-23 16:04:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:04:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:04:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:04:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:04:08,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:04:09,036 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:04:09,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:04:09,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:04:09,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:04:09,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:04:09,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:04:09,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:04:09,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:04:09,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2022-07-23 16:04:09,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:04:09,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:04:09,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:04:09,099 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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) [2022-07-23 16:04:09,102 INFO L158 Benchmark]: Toolchain (without parser) took 4158.61ms. Allocated memory was 88.1MB in the beginning and 136.3MB in the end (delta: 48.2MB). Free memory was 50.2MB in the beginning and 95.9MB in the end (delta: -45.7MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-07-23 16:04:09,103 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:04:09,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.33ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 50.0MB in the beginning and 82.4MB in the end (delta: -32.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 16:04:09,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:04:09,104 INFO L158 Benchmark]: Boogie Preprocessor took 19.01ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 79.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:04:09,104 INFO L158 Benchmark]: RCFGBuilder took 222.09ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 69.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 16:04:09,105 INFO L158 Benchmark]: BuchiAutomizer took 3530.15ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 68.7MB in the beginning and 95.9MB in the end (delta: -27.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2022-07-23 16:04:09,107 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.20ms. Allocated memory is still 88.1MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.33ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 50.0MB in the beginning and 82.4MB in the end (delta: -32.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 80.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.01ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 79.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.09ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 69.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3530.15ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 68.7MB in the beginning and 95.9MB in the end (delta: -27.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 16:04:09,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 16:04:09,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null