./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/array01-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:31:38,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:31:38,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:31:39,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:31:39,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:31:39,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:31:39,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:31:39,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:31:39,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:31:39,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:31:39,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:31:39,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:31:39,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:31:39,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:31:39,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:31:39,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:31:39,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:31:39,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:31:39,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:31:39,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:31:39,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:31:39,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:31:39,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:31:39,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:31:39,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:31:39,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:31:39,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:31:39,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:31:39,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:31:39,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:31:39,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:31:39,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:31:39,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:31:39,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:31:39,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:31:39,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:31:39,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:31:39,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:31:39,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:31:39,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:31:39,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:31:39,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:31:39,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:31:39,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:31:39,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:31:39,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:31:39,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:31:39,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:31:39,094 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:31:39,094 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:31:39,095 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:31:39,095 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:31:39,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:31:39,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:31:39,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:31:39,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:31:39,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:31:39,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:31:39,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:31:39,100 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:31:39,100 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 [2022-02-21 03:31:39,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:31:39,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:31:39,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:31:39,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:31:39,345 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:31:39,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2022-02-21 03:31:39,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe0de596/0f199ce6e37a47bab2195a9b59b79e9e/FLAG182336f5d [2022-02-21 03:31:39,825 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:31:39,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2022-02-21 03:31:39,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe0de596/0f199ce6e37a47bab2195a9b59b79e9e/FLAG182336f5d [2022-02-21 03:31:39,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe0de596/0f199ce6e37a47bab2195a9b59b79e9e [2022-02-21 03:31:39,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:31:39,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:31:39,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:39,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:31:39,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:31:39,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:39" (1/1) ... [2022-02-21 03:31:39,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3197e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:39, skipping insertion in model container [2022-02-21 03:31:39,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:39" (1/1) ... [2022-02-21 03:31:39,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:31:39,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:31:40,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:40,297 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:31:40,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:40,349 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:31:40,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40 WrapperNode [2022-02-21 03:31:40,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:40,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:40,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:31:40,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:31:40,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,378 INFO L137 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-02-21 03:31:40,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:40,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:31:40,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:31:40,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:31:40,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:31:40,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:31:40,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:31:40,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:31:40,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (1/1) ... [2022-02-21 03:31:40,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:40,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:40,427 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 03:31:40,437 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 03:31:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:31:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:31:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:31:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:31:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:31:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:31:40,586 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:31:40,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:31:40,765 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:31:40,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:31:40,770 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:31:40,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:40 BoogieIcfgContainer [2022-02-21 03:31:40,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:31:40,772 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:31:40,772 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:31:40,775 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:31:40,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:40,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:31:39" (1/3) ... [2022-02-21 03:31:40,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57ac0ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:40, skipping insertion in model container [2022-02-21 03:31:40,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:40,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:40" (2/3) ... [2022-02-21 03:31:40,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57ac0ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:40, skipping insertion in model container [2022-02-21 03:31:40,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:40,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:40" (3/3) ... [2022-02-21 03:31:40,778 INFO L388 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2022-02-21 03:31:40,820 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:31:40,820 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:31:40,820 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:31:40,820 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:31:40,821 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:31:40,821 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:31:40,821 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:31:40,821 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:31:40,834 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 03:31:40,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:40,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:40,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:40,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:31:40,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:40,864 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:31:40,864 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 03:31:40,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:40,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:40,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:40,867 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:31:40,867 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:31:40,872 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5#L561true assume !(main_~array_size~0#1 < 1); 8#L561-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 12#L565-3true [2022-02-21 03:31:40,872 INFO L793 eck$LassoCheckResult]: Loop: 12#L565-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 14#L565-2true main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12#L565-3true [2022-02-21 03:31:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 03:31:40,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:40,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39906311] [2022-02-21 03:31:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:40,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:40,975 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 03:31:40,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:40,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567939287] [2022-02-21 03:31:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:40,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:41,011 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 03:31:41,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:41,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124689371] [2022-02-21 03:31:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:41,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:41,051 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:41,336 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:41,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:41,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:41,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:41,338 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:41,338 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:41,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:41,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:41,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration1_Lasso [2022-02-21 03:31:41,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:41,338 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:41,360 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 03:31:41,376 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 03:31:41,519 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 03:31:41,521 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 03:31:41,524 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 03:31:41,526 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 03:31:41,529 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 03:31:41,530 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 03:31:41,534 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 03:31:41,536 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 03:31:41,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:41,791 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:41,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:41,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:41,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:41,798 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 03:31:41,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:41,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:41,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:41,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:41,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:41,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:41,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:41,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:31:41,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:41,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:41,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:41,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:31:41,841 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 03:31:41,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:41,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:41,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:41,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:41,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:41,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:41,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:41,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:41,904 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 03:31:41,905 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 03:31:41,909 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 03:31:41,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:41,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:41,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:41,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:41,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:41,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:41,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:41,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:41,964 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 03:31:41,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:41,966 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 03:31:41,967 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 03:31:41,968 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 03:31:41,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:41,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:41,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:41,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:41,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:41,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:41,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:42,018 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 03:31:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:42,020 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 03:31:42,021 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 03:31:42,022 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 03:31:42,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:42,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:42,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:42,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:42,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:42,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:42,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:42,066 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 03:31:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:42,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:42,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:31:42,070 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 03:31:42,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:42,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:42,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:42,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:42,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:42,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:42,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:42,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:42,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:42,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:42,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:42,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:42,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:31:42,106 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 03:31:42,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:42,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:42,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:42,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:42,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:42,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:42,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:42,165 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 03:31:42,171 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 03:31:42,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:42,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:42,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:31:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:31:42,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:42,209 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:31:42,209 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:42,210 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2022-02-21 03:31:42,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:42,262 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:31:42,283 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;" "main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2022-02-21 03:31:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:31:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:42,393 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 03:31:42,394 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {26#unseeded} is VALID [2022-02-21 03:31:42,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0#1 < 1); {26#unseeded} is VALID [2022-02-21 03:31:42,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {60#(and unseeded (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} is VALID [2022-02-21 03:31:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:31:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:42,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* (- 4) |ULTIMATE.start_main_~i~1#1|))) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0))} assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; {78#(and (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4 |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} is VALID [2022-02-21 03:31:42,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#(and (<= (+ (* |ULTIMATE.start_main_~i~1#1| 4) 4 |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {63#(and (>= |ULTIMATE.start_main_~numbers~0#1.offset| 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (* (- 4) |ULTIMATE.start_main_~i~1#1|)))) unseeded))} is VALID [2022-02-21 03:31:42,457 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 03:31:42,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:42,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,513 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 03:31:42,514 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:42,594 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 53 transitions. Complement of second has 7 states. [2022-02-21 03:31:42,594 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 03:31:42,595 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:42,595 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 03:31:42,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:42,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:31:42,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2022-02-21 03:31:42,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:31:42,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,601 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 03:31:42,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:31:42,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:31:42,603 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:31:42,605 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:42,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 03:31:42,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:31:42,606 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 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,606 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 03:31:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,607 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 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,608 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 38 letters. Loop has 38 letters. [2022-02-21 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,608 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 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:31:42,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:31:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 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 03:31:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 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 3 letters. [2022-02-21 03:31:42,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:31:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:31:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,610 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 03:31:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,610 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 6 letters. Loop has 3 letters. [2022-02-21 03:31:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:31:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:31:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,611 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 03:31:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:42,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,612 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 2 letters. [2022-02-21 03:31:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:31:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:31:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,612 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 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,613 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 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:31:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 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 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 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 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:31:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,615 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 03:31:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:31:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,615 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 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,616 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 4 letters. [2022-02-21 03:31:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:31:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:31:42,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,616 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-21 03:31:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:31:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:31:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:42,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:42,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2022-02-21 03:31:42,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:31:42,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2022-02-21 03:31:42,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:31:42,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:31:42,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:31:42,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:42,626 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:31:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:31:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:31:42,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:42,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 03:31:42,642 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 03:31:42,643 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 03:31:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:42,645 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:31:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:31:42,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:42,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:42,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 12 states and 16 transitions. [2022-02-21 03:31:42,646 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 12 states and 16 transitions. [2022-02-21 03:31:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:42,646 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:31:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:31:42,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:42,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:42,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:42,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 03:31:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:31:42,648 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:31:42,648 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:31:42,648 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:31:42,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:31:42,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:31:42,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,649 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:31:42,649 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:31:42,649 INFO L791 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 135#L561 assume !(main_~array_size~0#1 < 1); 136#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 137#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 139#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 142#L551-3 [2022-02-21 03:31:42,650 INFO L793 eck$LassoCheckResult]: Loop: 142#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 131#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 132#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 141#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 142#L551-3 [2022-02-21 03:31:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 03:31:42,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843758519] [2022-02-21 03:31:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:42,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2022-02-21 03:31:42,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {170#true} is VALID [2022-02-21 03:31:42,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume !(main_~array_size~0#1 < 1); {172#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 03:31:42,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; {173#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 03:31:42,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {173#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~i~1#1 < main_~array_size~0#1); {171#false} is VALID [2022-02-21 03:31:42,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#false} assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; {171#false} is VALID [2022-02-21 03:31:42,691 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 03:31:42,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:42,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843758519] [2022-02-21 03:31:42,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843758519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:42,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:42,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:31:42,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272379417] [2022-02-21 03:31:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:42,694 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:31:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2022-02-21 03:31:42,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594937757] [2022-02-21 03:31:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,704 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:42,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:31:42,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:31:42,739 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:42,766 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:31:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:31:42,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:42,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:42,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-02-21 03:31:42,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:31:42,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 03:31:42,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:31:42,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:31:42,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 03:31:42,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:31:42,772 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 03:31:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 03:31:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 03:31:42,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:42,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 03:31:42,773 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 03:31:42,773 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 03:31:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:42,773 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:31:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:31:42,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:42,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:42,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 16 transitions. [2022-02-21 03:31:42,774 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 16 transitions. [2022-02-21 03:31:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:42,774 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 03:31:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:31:42,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:42,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:42,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:42,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 03:31:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 03:31:42,789 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:31:42,789 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:31:42,789 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:31:42,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:31:42,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:31:42,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:42,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:42,790 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:31:42,790 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:31:42,790 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 191#L561 assume !(main_~array_size~0#1 < 1); 192#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 193#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1; 194#L565-2 main_#t~post9#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 195#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 196#L565-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 200#L551-3 [2022-02-21 03:31:42,790 INFO L793 eck$LassoCheckResult]: Loop: 200#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 197#L552-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 198#L552-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 199#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 200#L551-3 [2022-02-21 03:31:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 03:31:42,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724248] [2022-02-21 03:31:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,812 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2022-02-21 03:31:42,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061368340] [2022-02-21 03:31:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,820 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2022-02-21 03:31:42,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:42,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17519316] [2022-02-21 03:31:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:42,856 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:43,216 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:43,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:43,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:43,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:43,216 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:43,216 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:43,216 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:43,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:43,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration3_Lasso [2022-02-21 03:31:43,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:43,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:43,221 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 03:31:43,223 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 03:31:43,226 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 03:31:43,228 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 03:31:43,231 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 03:31:43,234 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 03:31:43,257 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_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset (* ULTIMATE.start_test_fun_~i~0#1 4)))_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 03:31:43,263 INFO L158 Benchmark]: Toolchain (without parser) took 3414.22ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 87.3MB in the beginning and 134.7MB in the end (delta: -47.4MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-02-21 03:31:43,264 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:43,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.10ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 93.4MB in the end (delta: -6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:31:43,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.47ms. Allocated memory is still 125.8MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:43,265 INFO L158 Benchmark]: Boogie Preprocessor took 18.73ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:43,265 INFO L158 Benchmark]: RCFGBuilder took 373.40ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 78.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:31:43,266 INFO L158 Benchmark]: BuchiAutomizer took 2489.67ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 78.2MB in the beginning and 134.7MB in the end (delta: -56.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2022-02-21 03:31:43,267 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.14ms. Allocated memory is still 125.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.10ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 93.4MB in the end (delta: -6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.47ms. Allocated memory is still 125.8MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.73ms. Allocated memory is still 125.8MB. Free memory was 91.9MB in the beginning and 90.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 373.40ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 78.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2489.67ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 78.2MB in the beginning and 134.7MB in the end (delta: -56.5MB). Peak memory consumption was 44.7MB. 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_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset (* ULTIMATE.start_test_fun_~i~0#1 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset (* ULTIMATE.start_test_fun_~i~0#1 4)))_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 03:31:43,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset (* ULTIMATE.start_test_fun_~i~0#1 4)))_1 was not added to the transformula!