./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/mult_array-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/mult_array-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 516828c2d0e4e4ea6fd7a5826d09ca378c2c75a9f8159cf96c4b4e28ff76714b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:12,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:12,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:12,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:12,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:12,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:12,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:12,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:12,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:12,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:12,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:12,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:12,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:12,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:12,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:12,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:12,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:12,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:12,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:12,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:12,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:12,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:12,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:12,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:12,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:12,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:12,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:12,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:12,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:12,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:12,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:12,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:12,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:12,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:12,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:12,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:12,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:12,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:12,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:12,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:12,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:12,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:12,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:12,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:12,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:12,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:12,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:12,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:12,918 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:12,919 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:12,919 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:12,919 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:12,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:12,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:12,920 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:12,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:12,920 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:12,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:12,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:12,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:12,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:12,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:12,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:12,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:12,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:12,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:12,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:12,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:12,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:12,925 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 -> 516828c2d0e4e4ea6fd7a5826d09ca378c2c75a9f8159cf96c4b4e28ff76714b [2022-02-21 04:35:13,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:13,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:13,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:13,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:13,223 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:13,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/mult_array-alloca-1.i [2022-02-21 04:35:13,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3365a4aeb/d85dddac225c4c309384b60b0e27b2d2/FLAG54361d50b [2022-02-21 04:35:13,758 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:13,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/mult_array-alloca-1.i [2022-02-21 04:35:13,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3365a4aeb/d85dddac225c4c309384b60b0e27b2d2/FLAG54361d50b [2022-02-21 04:35:14,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3365a4aeb/d85dddac225c4c309384b60b0e27b2d2 [2022-02-21 04:35:14,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:14,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:14,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:14,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:14,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:14,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abac53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14, skipping insertion in model container [2022-02-21 04:35:14,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:14,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:14,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:14,567 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:14,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:14,649 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:14,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14 WrapperNode [2022-02-21 04:35:14,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:14,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:14,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:14,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:14,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,713 INFO L137 Inliner]: procedures = 115, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2022-02-21 04:35:14,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:14,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:14,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:14,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:14,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:14,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:14,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:14,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:14,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (1/1) ... [2022-02-21 04:35:14,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:14,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:14,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:14,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:14,949 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:14,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:15,229 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:15,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:15,234 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:15,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:15 BoogieIcfgContainer [2022-02-21 04:35:15,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:15,239 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:15,240 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:15,243 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:15,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:14" (1/3) ... [2022-02-21 04:35:15,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c4c162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:15, skipping insertion in model container [2022-02-21 04:35:15,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:14" (2/3) ... [2022-02-21 04:35:15,245 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9c4c162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:15, skipping insertion in model container [2022-02-21 04:35:15,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:15,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:15" (3/3) ... [2022-02-21 04:35:15,248 INFO L388 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca-1.i [2022-02-21 04:35:15,296 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:15,296 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:15,296 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:15,296 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:15,297 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:15,297 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:15,297 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:15,297 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:15,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-02-21 04:35:15,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:15,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:15,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:15,351 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:15,351 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:15,351 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:15,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-02-21 04:35:15,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:15,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:15,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:15,358 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:15,358 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:15,364 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~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; 9#L515true assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 6#L515-2true main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 17#L517true assume !(main_~fac~0#1 < 1 || main_~fac~0#1 % 4294967296 >= 2147483647 / (4 * main_~length~0#1 % 4294967296) % 4294967296); 10#L517-2true call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 11#L520true assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 5#L521-3true [2022-02-21 04:35:15,364 INFO L793 eck$LassoCheckResult]: Loop: 5#L521-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; 7#L521-2true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5#L521-3true [2022-02-21 04:35:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2022-02-21 04:35:15,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638977042] [2022-02-21 04:35:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,481 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:15,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020798065] [2022-02-21 04:35:15,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:15,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 04:35:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,650 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-02-21 04:35:15,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521451629] [2022-02-21 04:35:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,684 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1182787760, now seen corresponding path program 1 times [2022-02-21 04:35:15,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:15,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553382873] [2022-02-21 04:35:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:15,715 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:15,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19798057] [2022-02-21 04:35:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:15,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:15,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:15,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:15,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 04:35:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:15,866 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:16,420 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:16,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:16,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:16,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:16,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:16,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:16,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:16,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:16,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-1.i_Iteration1_Lasso [2022-02-21 04:35:16,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:16,423 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:16,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:16,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:35,710 WARN L228 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 104 DAG size of output: 74 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-02-21 04:35:38,980 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:38,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:39,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:39,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:39,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:39,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:39,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:39,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:39,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:39,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:39,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:39,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:39,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:39,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:39,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:39,180 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 04:35:39,180 INFO L444 ModelExtractionUtils]: 14 out of 28 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,193 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:39,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:39,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:39,227 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:39,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 04:35:39,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:39,303 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:39,308 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1;" "main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2022-02-21 04:35:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:39,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~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; {26#unseeded} is VALID [2022-02-21 04:35:39,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {26#unseeded} is VALID [2022-02-21 04:35:39,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {26#unseeded} is VALID [2022-02-21 04:35:39,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#unseeded} assume !(main_~fac~0#1 < 1 || main_~fac~0#1 % 4294967296 >= 2147483647 / (4 * main_~length~0#1 % 4294967296) % 4294967296); {26#unseeded} is VALID [2022-02-21 04:35:39,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#unseeded} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {26#unseeded} is VALID [2022-02-21 04:35:39,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#unseeded} assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; {26#unseeded} is VALID [2022-02-21 04:35:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:39,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:39,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {92#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 04:35:39,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {69#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 04:35:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:39,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,473 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-02-21 04:35:39,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 46 transitions. Complement of second has 7 states. [2022-02-21 04:35:39,803 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-02-21 04:35:39,803 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-02-21 04:35:39,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:39,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:39,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-02-21 04:35:39,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,822 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-02-21 04:35:39,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:35:39,829 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:39,829 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:39,837 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:39,838 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 46 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:39,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:39,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:39,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:39,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:39,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:39,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:39,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:39,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:39,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:39,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:39,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:39,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:39,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:39,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:39,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:39,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:39,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,867 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 04:35:39,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:39,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:39,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:39,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:39,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. cyclomatic complexity: 15 [2022-02-21 04:35:39,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 17 transitions. [2022-02-21 04:35:39,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:39,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:39,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 04:35:39,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:39,887 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 04:35:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 04:35:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 04:35:39,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:39,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-02-21 04:35:39,911 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-02-21 04:35:39,913 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-02-21 04:35:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:39,916 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 04:35:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 04:35:39,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:39,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:39,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 13 states and 17 transitions. [2022-02-21 04:35:39,918 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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 13 states and 17 transitions. [2022-02-21 04:35:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:39,920 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 04:35:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 04:35:39,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:39,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:39,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:39,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-02-21 04:35:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 04:35:39,924 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 04:35:39,924 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 04:35:39,925 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:39,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 04:35:39,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:39,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:39,927 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:39,927 INFO L791 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~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; 151#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 148#L515-2 main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 149#L517 assume !(main_~fac~0#1 < 1 || main_~fac~0#1 % 4294967296 >= 2147483647 / (4 * main_~length~0#1 % 4294967296) % 4294967296); 152#L517-2 call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 153#L520 assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 143#L521-3 assume !(main_~i~0#1 < main_~length~0#1); 144#L521-4 main_~j~0#1 := 0; 147#L524-3 [2022-02-21 04:35:39,928 INFO L793 eck$LassoCheckResult]: Loop: 147#L524-3 assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1; 150#L524-2 main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 147#L524-3 [2022-02-21 04:35:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1182787702, now seen corresponding path program 1 times [2022-02-21 04:35:39,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32343293] [2022-02-21 04:35:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,957 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:39,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490966783] [2022-02-21 04:35:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 04:35:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:40,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 04:35:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:40,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:40,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {183#true} is VALID [2022-02-21 04:35:40,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~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; {183#true} is VALID [2022-02-21 04:35:40,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 04:35:40,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 04:35:40,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} assume !(main_~fac~0#1 < 1 || main_~fac~0#1 % 4294967296 >= 2147483647 / (4 * main_~length~0#1 % 4294967296) % 4294967296); {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 04:35:40,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 04:35:40,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; {207#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (< |ULTIMATE.start_main_~length~0#1| 1)))} is VALID [2022-02-21 04:35:40,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (< |ULTIMATE.start_main_~length~0#1| 1)))} assume !(main_~i~0#1 < main_~length~0#1); {184#false} is VALID [2022-02-21 04:35:40,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} main_~j~0#1 := 0; {184#false} is VALID [2022-02-21 04:35:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:40,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 04:35:40,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:40,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32343293] [2022-02-21 04:35:40,100 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 04:35:40,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490966783] [2022-02-21 04:35:40,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490966783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:40,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:40,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:40,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098738456] [2022-02-21 04:35:40,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:40,104 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2022-02-21 04:35:40,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:40,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480313086] [2022-02-21 04:35:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:40,117 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:40,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941728445] [2022-02-21 04:35:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:40,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 04:35:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:40,168 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:40,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:42,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:42,245 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,372 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 04:35:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:42,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:42,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2022-02-21 04:35:42,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:42,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 04:35:42,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 04:35:42,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:35:42,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2022-02-21 04:35:42,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:42,386 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 04:35:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2022-02-21 04:35:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 04:35:42,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:42,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-02-21 04:35:42,388 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-02-21 04:35:42,388 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-02-21 04:35:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,389 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 04:35:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 04:35:42,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 14 states and 17 transitions. [2022-02-21 04:35:42,390 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 14 states and 17 transitions. [2022-02-21 04:35:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,391 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 04:35:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 04:35:42,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:42,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-02-21 04:35:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 04:35:42,393 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:42,393 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:42,393 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:42,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:42,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:42,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:42,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:42,394 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:42,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:42,394 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 228#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~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; 237#L515 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 234#L515-2 main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 235#L517 assume !(main_~fac~0#1 < 1 || main_~fac~0#1 % 4294967296 >= 2147483647 / (4 * main_~length~0#1 % 4294967296) % 4294967296); 238#L517-2 call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 239#L520 assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 229#L521-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; 230#L521-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 231#L521-3 assume !(main_~i~0#1 < main_~length~0#1); 232#L521-4 main_~j~0#1 := 0; 233#L524-3 [2022-02-21 04:35:42,394 INFO L793 eck$LassoCheckResult]: Loop: 233#L524-3 assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1; 236#L524-2 main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 233#L524-3 [2022-02-21 04:35:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1507295208, now seen corresponding path program 1 times [2022-02-21 04:35:42,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206259112] [2022-02-21 04:35:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,407 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:42,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580724518] [2022-02-21 04:35:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:42,412 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-02-21 04:35:42,414 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-02-21 04:35:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,518 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 2 times [2022-02-21 04:35:42,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293404542] [2022-02-21 04:35:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,525 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:42,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919700665] [2022-02-21 04:35:42,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:35:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:42,529 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 04:35:42,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 04:35:42,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 04:35:42,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,581 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1106714758, now seen corresponding path program 1 times [2022-02-21 04:35:42,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773785972] [2022-02-21 04:35:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,595 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 04:35:42,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051555886] [2022-02-21 04:35:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:35:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:42,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:35:42,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 04:35:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,723 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:52,710 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:52,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:52,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:52,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:52,710 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:52,710 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:52,710 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:52,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:52,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-1.i_Iteration3_Lasso [2022-02-21 04:35:52,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:52,711 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:52,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:54,398 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* (mod ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~length~0#1) 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:54,403 INFO L158 Benchmark]: Toolchain (without parser) took 40146.23ms. Allocated memory was 88.1MB in the beginning and 136.3MB in the end (delta: 48.2MB). Free memory was 50.5MB in the beginning and 43.9MB in the end (delta: 6.7MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,404 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 68.5MB in the beginning and 68.4MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:54,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.81ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 81.5MB in the end (delta: -31.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.70ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,406 INFO L158 Benchmark]: Boogie Preprocessor took 30.73ms. Allocated memory is still 113.2MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,407 INFO L158 Benchmark]: RCFGBuilder took 492.72ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 65.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,410 INFO L158 Benchmark]: BuchiAutomizer took 39161.42ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 64.8MB in the beginning and 43.9MB in the end (delta: 21.0MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:54,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 68.5MB in the beginning and 68.4MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.81ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 81.5MB in the end (delta: -31.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.70ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.73ms. Allocated memory is still 113.2MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.72ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 65.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 39161.42ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 64.8MB in the beginning and 43.9MB in the end (delta: 21.0MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* (mod ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~length~0#1) 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* (mod ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~length~0#1) 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:54,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:54,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-21 04:35:54,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 04:35:55,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-21 04:35:55,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:55,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:55,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 04:35:55,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*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: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* (mod ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~length~0#1) 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!