./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 6c24879c 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-?-6c24879 [2022-07-13 04:51:56,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:51:56,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:51:56,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:51:56,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:51:56,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:51:56,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:51:56,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:51:56,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:51:56,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:51:56,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:51:56,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:51:56,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:51:56,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:51:56,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:51:56,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:51:56,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:51:56,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:51:56,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:51:56,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:51:56,441 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:51:56,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:51:56,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:51:56,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:51:56,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:51:56,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:51:56,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:51:56,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:51:56,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:51:56,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:51:56,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:51:56,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:51:56,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:51:56,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:51:56,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:51:56,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:51:56,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:51:56,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:51:56,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:51:56,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:51:56,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:51:56,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:51:56,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:51:56,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:51:56,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:51:56,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:51:56,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:51:56,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:51:56,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:51:56,495 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:51:56,495 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:51:56,495 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:51:56,496 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:51:56,496 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:51:56,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:51:56,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:51:56,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:51:56,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:51:56,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:51:56,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:51:56,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:51:56,500 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:51:56,500 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-13 04:51:56,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:51:56,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:51:56,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:51:56,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:51:56,745 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:51:56,747 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-13 04:51:56,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876c474c8/f3d62287bfb840a7b3856e14dc49eabe/FLAGa0a8a43be [2022-07-13 04:51:57,239 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:51:57,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/add_last-alloca-1.i [2022-07-13 04:51:57,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876c474c8/f3d62287bfb840a7b3856e14dc49eabe/FLAGa0a8a43be [2022-07-13 04:51:57,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876c474c8/f3d62287bfb840a7b3856e14dc49eabe [2022-07-13 04:51:57,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:51:57,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:51:57,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:57,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:51:57,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:51:57,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:57" (1/1) ... [2022-07-13 04:51:57,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7c518b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:57, skipping insertion in model container [2022-07-13 04:51:57,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:51:57" (1/1) ... [2022-07-13 04:51:57,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:51:57,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:51:57,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:57,938 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:51:57,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:51:58,010 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:51:58,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58 WrapperNode [2022-07-13 04:51:58,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:51:58,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:58,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:51:58,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:51:58,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,060 INFO L137 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-13 04:51:58,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:51:58,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:51:58,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:51:58,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:51:58,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:51:58,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:51:58,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:51:58,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:51:58,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (1/1) ... [2022-07-13 04:51:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:58,123 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-13 04:51:58,127 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-13 04:51:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:51:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:51:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:51:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:51:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:51:58,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:51:58,217 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:51:58,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:51:58,302 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:51:58,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:51:58,308 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 04:51:58,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:58 BoogieIcfgContainer [2022-07-13 04:51:58,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:51:58,310 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:51:58,310 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:51:58,313 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:51:58,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:58,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:51:57" (1/3) ... [2022-07-13 04:51:58,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55cad68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:58, skipping insertion in model container [2022-07-13 04:51:58,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:58,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:51:58" (2/3) ... [2022-07-13 04:51:58,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55cad68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:51:58, skipping insertion in model container [2022-07-13 04:51:58,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:51:58,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:51:58" (3/3) ... [2022-07-13 04:51:58,317 INFO L354 chiAutomizerObserver]: Analyzing ICFG add_last-alloca-1.i [2022-07-13 04:51:58,360 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:51:58,361 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:51:58,361 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:51:58,361 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:51:58,361 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:51:58,361 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:51:58,361 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:51:58,362 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:51:58,370 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-13 04:51:58,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 04:51:58,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:58,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:58,388 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:51:58,389 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:58,389 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:51:58,389 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-13 04:51:58,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 04:51:58,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:51:58,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:51:58,391 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:51:58,391 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:51:58,397 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-13 04:51:58,397 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-13 04:51:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-07-13 04:51:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:58,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894496573] [2022-07-13 04:51:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2022-07-13 04:51:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816291064] [2022-07-13 04:51:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2022-07-13 04:51:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:51:58,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064724659] [2022-07-13 04:51:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:51:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:51:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:51:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:51:58,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:51:58,926 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:51:58,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:51:58,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:51:58,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:51:58,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:51:58,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:58,928 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:51:58,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:51:58,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration1_Lasso [2022-07-13 04:51:58,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:51:58,928 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:51:58,948 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-13 04:51:58,953 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-13 04:51:58,956 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-13 04:51:58,958 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-13 04:51:59,082 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-13 04:51:59,086 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-13 04:51:59,088 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-13 04:51:59,090 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-13 04:51:59,092 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-13 04:51:59,094 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-13 04:51:59,096 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-13 04:51:59,098 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-13 04:51:59,100 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-13 04:51:59,102 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-13 04:51:59,104 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-13 04:51:59,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:59,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 04:51:59,395 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:51:59,398 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:51:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,407 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-13 04:51:59,415 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-13 04:51:59,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:59,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,424 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-13 04:51:59,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:59,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:59,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:59,464 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-13 04:51:59,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,468 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-13 04:51:59,468 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-13 04:51:59,470 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-13 04:51:59,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:59,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:59,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:59,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:59,516 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-13 04:51:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,518 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-13 04:51:59,523 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-13 04:51:59,524 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-13 04:51:59,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:51:59,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:51:59,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:51:59,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:59,548 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-13 04:51:59,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,550 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-13 04:51:59,551 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-13 04:51:59,552 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-13 04:51:59,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:59,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:59,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:59,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 04:51:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,610 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-13 04:51:59,611 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-13 04:51:59,612 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-13 04:51:59,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:59,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:59,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:51:59,662 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-13 04:51:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,664 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-13 04:51:59,667 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-13 04:51:59,668 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-13 04:51:59,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:51:59,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:51:59,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:51:59,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:51:59,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:51:59,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:51:59,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:51:59,723 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-13 04:51:59,723 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 04:51:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:51:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:51:59,727 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-13 04:51:59,784 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:51:59,790 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-13 04:51:59,802 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:51:59,803 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:51:59,803 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-13 04:51:59,846 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-13 04:51:59,855 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-13 04:51:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:51:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:59,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:51:59,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:51:59,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:51:59,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:51:59,968 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-13 04:52:00,002 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-13 04:52:00,003 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-13 04:52:00,045 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-13 04:52:00,047 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-13 04:52:00,054 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-13 04:52:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-07-13 04:52:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-13 04:52:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:52:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 04:52:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:52:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-13 04:52:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:52:00,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-07-13 04:52:00,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:00,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 11 states and 14 transitions. [2022-07-13 04:52:00,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 04:52:00,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 04:52:00,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-07-13 04:52:00,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:52:00,063 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-13 04:52:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-07-13 04:52:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-13 04:52:00,078 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-13 04:52:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-13 04:52:00,079 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 04:52:00,079 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 04:52:00,079 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:52:00,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-07-13 04:52:00,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:00,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:52:00,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:52:00,080 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:52:00,081 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:52:00,081 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-13 04:52:00,081 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-13 04:52:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2022-07-13 04:52:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:00,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986646574] [2022-07-13 04:52:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:52:00,129 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-13 04:52:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:52:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986646574] [2022-07-13 04:52:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986646574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:52:00,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:52:00,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:52:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529074386] [2022-07-13 04:52:00,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:52:00,133 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:52:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 1 times [2022-07-13 04:52:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:00,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176139485] [2022-07-13 04:52:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:52:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:52:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:52:00,244 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-13 04:52:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:52:00,267 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-07-13 04:52:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:52:00,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-07-13 04:52:00,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:00,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2022-07-13 04:52:00,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 04:52:00,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 04:52:00,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-07-13 04:52:00,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:52:00,271 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-07-13 04:52:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-07-13 04:52:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-07-13 04:52:00,272 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-13 04:52:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-07-13 04:52:00,273 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-07-13 04:52:00,273 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-07-13 04:52:00,273 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:52:00,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-07-13 04:52:00,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:00,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:52:00,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:52:00,275 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:52:00,275 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:52:00,275 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-13 04:52:00,276 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-13 04:52:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 176707625, now seen corresponding path program 1 times [2022-07-13 04:52:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:00,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910201767] [2022-07-13 04:52:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 2 times [2022-07-13 04:52:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:00,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757880659] [2022-07-13 04:52:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:00,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1982663218, now seen corresponding path program 1 times [2022-07-13 04:52:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604330999] [2022-07-13 04:52:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:52:00,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:52:00,711 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-13 04:52:00,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:52:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604330999] [2022-07-13 04:52:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604330999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:52:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487456224] [2022-07-13 04:52:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:52:00,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:52:00,714 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-13 04:52:00,750 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-13 04:52:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:52:00,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 04:52:00,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:52:00,839 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-13 04:52:00,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 04:52:00,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:52:00,924 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-13 04:52:00,932 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-13 04:52:00,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:52:00,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:52:01,000 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-13 04:52:01,036 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-13 04:52:01,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:52:01,052 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-13 04:52:01,147 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-13 04:52:01,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487456224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:52:01,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:52:01,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-07-13 04:52:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940372102] [2022-07-13 04:52:01,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:52:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:52:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 04:52:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-07-13 04:52:01,219 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-13 04:52:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:52:01,341 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-07-13 04:52:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 04:52:01,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-07-13 04:52:01,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:01,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 15 transitions. [2022-07-13 04:52:01,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 04:52:01,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 04:52:01,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2022-07-13 04:52:01,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:52:01,344 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 04:52:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2022-07-13 04:52:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-07-13 04:52:01,345 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-13 04:52:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-07-13 04:52:01,346 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-13 04:52:01,346 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-13 04:52:01,346 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:52:01,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-07-13 04:52:01,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 04:52:01,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:52:01,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:52:01,347 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 04:52:01,348 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:52:01,348 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-13 04:52:01,348 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-13 04:52:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1982661529, now seen corresponding path program 2 times [2022-07-13 04:52:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:01,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480341248] [2022-07-13 04:52:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1958, now seen corresponding path program 3 times [2022-07-13 04:52:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:01,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592476070] [2022-07-13 04:52:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:52:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1627751052, now seen corresponding path program 2 times [2022-07-13 04:52:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:52:01,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381573907] [2022-07-13 04:52:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:52:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:52:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:52:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:52:01,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:52:01,666 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:52:01,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:52:01,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:52:01,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:52:01,666 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:52:01,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:52:01,666 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:52:01,666 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:52:01,666 INFO L133 ssoRankerPreferences]: Filename of dumped script: add_last-alloca-1.i_Iteration4_Lasso [2022-07-13 04:52:01,666 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:52:01,666 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:52:01,684 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-13 04:52:01,690 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-13 04:52:01,692 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-13 04:52:01,694 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-13 04:52:01,696 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-13 04:52:01,698 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-13 04:52:01,701 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-13 04:52:01,703 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-13 04:52:01,705 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-13 04:52:01,707 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-13 04:52:01,709 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-13 04:52:01,711 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-13 04:52:01,713 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-13 04:52:01,714 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-13 04:52:01,749 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-13 04:52:01,752 INFO L158 Benchmark]: Toolchain (without parser) took 4130.47ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 61.9MB in the beginning and 103.5MB in the end (delta: -41.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,752 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:52:01,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.26ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.7MB in the beginning and 82.6MB in the end (delta: -20.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.65ms. Allocated memory is still 113.2MB. Free memory was 82.6MB in the beginning and 80.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,756 INFO L158 Benchmark]: Boogie Preprocessor took 23.78ms. Allocated memory is still 113.2MB. Free memory was 80.7MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,757 INFO L158 Benchmark]: RCFGBuilder took 224.05ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 69.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,758 INFO L158 Benchmark]: BuchiAutomizer took 3441.12ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 69.2MB in the beginning and 103.5MB in the end (delta: -34.3MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-07-13 04:52:01,761 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.19ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.26ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.7MB in the beginning and 82.6MB in the end (delta: -20.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.65ms. Allocated memory is still 113.2MB. Free memory was 82.6MB in the beginning and 80.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.78ms. Allocated memory is still 113.2MB. Free memory was 80.7MB in the beginning and 79.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.05ms. Allocated memory is still 113.2MB. Free memory was 79.3MB in the beginning and 69.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3441.12ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 69.2MB in the beginning and 103.5MB in the end (delta: -34.3MB). Peak memory consumption was 41.0MB. 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-13 04:52:01,797 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-13 04:52:01,996 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