./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 15:08:55,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:08:55,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:08:55,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:08:55,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:08:55,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:08:55,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:08:55,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:08:55,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:08:55,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:08:55,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:08:55,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:08:55,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:08:55,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:08:55,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:08:55,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:08:55,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:08:55,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:08:55,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:08:55,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:08:55,363 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:08:55,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:08:55,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:08:55,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:08:55,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:08:55,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:08:55,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:08:55,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:08:55,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:08:55,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:08:55,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:08:55,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:08:55,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:08:55,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:08:55,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:08:55,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:08:55,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:08:55,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:08:55,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:08:55,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:08:55,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:08:55,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:08:55,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:08:55,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:08:55,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:08:55,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:08:55,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:08:55,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:08:55,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:08:55,405 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:08:55,405 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:08:55,405 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:08:55,406 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:08:55,406 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:08:55,406 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:08:55,406 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:08:55,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:08:55,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:08:55,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:08:55,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:08:55,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:08:55,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:08:55,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:08:55,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:08:55,410 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:08:55,410 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2022-07-23 15:08:55,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:08:55,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:08:55,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:08:55,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:08:55,610 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:08:55,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2022-07-23 15:08:55,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483c1650/ef9f4cd303f847498e055757f6dbb77e/FLAGe62154b9f [2022-07-23 15:08:56,008 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:08:56,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2022-07-23 15:08:56,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483c1650/ef9f4cd303f847498e055757f6dbb77e/FLAGe62154b9f [2022-07-23 15:08:56,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7483c1650/ef9f4cd303f847498e055757f6dbb77e [2022-07-23 15:08:56,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:08:56,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:08:56,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:08:56,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:08:56,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:08:56,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38222c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56, skipping insertion in model container [2022-07-23 15:08:56,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:08:56,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:08:56,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2022-07-23 15:08:56,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:08:56,176 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:08:56,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i[893,906] [2022-07-23 15:08:56,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:08:56,200 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:08:56,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56 WrapperNode [2022-07-23 15:08:56,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:08:56,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:08:56,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:08:56,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:08:56,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,229 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-07-23 15:08:56,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:08:56,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:08:56,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:08:56,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:08:56,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:08:56,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:08:56,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:08:56,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:08:56,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (1/1) ... [2022-07-23 15:08:56,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:56,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:56,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 15:08:56,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:08:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:08:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:08:56,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:08:56,366 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:08:56,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:08:56,470 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:08:56,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:08:56,474 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 15:08:56,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:08:56 BoogieIcfgContainer [2022-07-23 15:08:56,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:08:56,476 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:08:56,476 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:08:56,479 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:08:56,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:08:56,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:08:56" (1/3) ... [2022-07-23 15:08:56,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e5eb845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:08:56, skipping insertion in model container [2022-07-23 15:08:56,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:08:56,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:08:56" (2/3) ... [2022-07-23 15:08:56,481 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e5eb845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:08:56, skipping insertion in model container [2022-07-23 15:08:56,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:08:56,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:08:56" (3/3) ... [2022-07-23 15:08:56,482 INFO L354 chiAutomizerObserver]: Analyzing ICFG id_build.i [2022-07-23 15:08:56,518 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:08:56,526 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:08:56,527 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:08:56,527 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:08:56,527 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:08:56,527 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:08:56,527 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:08:56,527 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:08:56,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:56,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 15:08:56,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:56,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:56,547 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 15:08:56,548 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 15:08:56,548 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:08:56,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-07-23 15:08:56,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:56,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:56,550 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 15:08:56,550 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 15:08:56,560 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 14#L27-3true [2022-07-23 15:08:56,561 INFO L754 eck$LassoCheckResult]: Loop: 14#L27-3true assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 15#L28-3true assume !(main_~j~0#1 < 8); 10#L27-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 14#L27-3true [2022-07-23 15:08:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 15:08:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:56,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53169201] [2022-07-23 15:08:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:56,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:56,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash 39941, now seen corresponding path program 1 times [2022-07-23 15:08:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:56,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935572635] [2022-07-23 15:08:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:08:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935572635] [2022-07-23 15:08:56,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935572635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:08:56,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:08:56,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 15:08:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753076971] [2022-07-23 15:08:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:08:56,714 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:08:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:08:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:08:56,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:08:56,741 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:08:56,756 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-07-23 15:08:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:08:56,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2022-07-23 15:08:56,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-23 15:08:56,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 17 transitions. [2022-07-23 15:08:56,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 15:08:56,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-23 15:08:56,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2022-07-23 15:08:56,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:08:56,766 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-07-23 15:08:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2022-07-23 15:08:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2022-07-23 15:08:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-23 15:08:56,783 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-23 15:08:56,784 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-23 15:08:56,784 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:08:56,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2022-07-23 15:08:56,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-23 15:08:56,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:56,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:56,785 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 15:08:56,785 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:08:56,785 INFO L752 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 56#L27-3 [2022-07-23 15:08:56,786 INFO L754 eck$LassoCheckResult]: Loop: 56#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 57#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 49#L18 assume !(0 == __VERIFIER_assert_~cond#1); 50#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 53#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 54#L18-5 assume { :end_inline___VERIFIER_assert } true; 55#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 58#L28-3 assume !(main_~j~0#1 < 8); 59#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 56#L27-3 [2022-07-23 15:08:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 15:08:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:56,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783743744] [2022-07-23 15:08:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:56,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:56,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1762492053, now seen corresponding path program 1 times [2022-07-23 15:08:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874791241] [2022-07-23 15:08:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:08:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874791241] [2022-07-23 15:08:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874791241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 15:08:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493917898] [2022-07-23 15:08:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 15:08:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:56,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 15:08:56,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 15:08:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:56,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 15:08:56,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:56,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 15:08:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:56,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493917898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 15:08:56,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 15:08:56,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-23 15:08:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305295272] [2022-07-23 15:08:56,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 15:08:56,970 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:08:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:08:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 15:08:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-23 15:08:56,971 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:08:56,997 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-23 15:08:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 15:08:56,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2022-07-23 15:08:57,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-07-23 15:08:57,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2022-07-23 15:08:57,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-23 15:08:57,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-23 15:08:57,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2022-07-23 15:08:57,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:08:57,005 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-23 15:08:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2022-07-23 15:08:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-23 15:08:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-07-23 15:08:57,009 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-23 15:08:57,009 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-23 15:08:57,010 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:08:57,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2022-07-23 15:08:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-07-23 15:08:57,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:57,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:57,012 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 15:08:57,012 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 1, 1, 1] [2022-07-23 15:08:57,013 INFO L752 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 155#L27-3 [2022-07-23 15:08:57,013 INFO L754 eck$LassoCheckResult]: Loop: 155#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 156#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 146#L18 assume !(0 == __VERIFIER_assert_~cond#1); 147#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 154#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 152#L18-5 assume { :end_inline___VERIFIER_assert } true; 153#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 157#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 174#L18 assume !(0 == __VERIFIER_assert_~cond#1); 150#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 151#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 173#L18-5 assume { :end_inline___VERIFIER_assert } true; 172#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 171#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 170#L18 assume !(0 == __VERIFIER_assert_~cond#1); 169#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 168#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 167#L18-5 assume { :end_inline___VERIFIER_assert } true; 166#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 165#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 160#L18 assume !(0 == __VERIFIER_assert_~cond#1); 164#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 163#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 162#L18-5 assume { :end_inline___VERIFIER_assert } true; 161#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 159#L28-3 assume !(main_~j~0#1 < 8); 158#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 155#L27-3 [2022-07-23 15:08:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 15:08:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:57,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079152155] [2022-07-23 15:08:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1080615355, now seen corresponding path program 2 times [2022-07-23 15:08:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:57,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973411999] [2022-07-23 15:08:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:08:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973411999] [2022-07-23 15:08:57,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973411999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 15:08:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048375769] [2022-07-23 15:08:57,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 15:08:57,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 15:08:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:57,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 15:08:57,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 15:08:57,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 15:08:57,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 15:08:57,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 15:08:57,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:57,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 15:08:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048375769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 15:08:57,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 15:08:57,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-23 15:08:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432319372] [2022-07-23 15:08:57,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 15:08:57,326 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:08:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:08:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 15:08:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-23 15:08:57,329 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:08:57,382 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-07-23 15:08:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 15:08:57,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 54 transitions. [2022-07-23 15:08:57,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-07-23 15:08:57,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 54 transitions. [2022-07-23 15:08:57,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-07-23 15:08:57,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-07-23 15:08:57,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 54 transitions. [2022-07-23 15:08:57,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:08:57,386 INFO L369 hiAutomatonCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-07-23 15:08:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 54 transitions. [2022-07-23 15:08:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-23 15:08:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-07-23 15:08:57,388 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-07-23 15:08:57,388 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-07-23 15:08:57,389 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:08:57,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 54 transitions. [2022-07-23 15:08:57,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-07-23 15:08:57,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:57,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:57,390 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 15:08:57,390 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 1, 1, 1] [2022-07-23 15:08:57,390 INFO L752 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 406#L27-3 [2022-07-23 15:08:57,390 INFO L754 eck$LassoCheckResult]: Loop: 406#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 407#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 397#L18 assume !(0 == __VERIFIER_assert_~cond#1); 398#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 405#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 403#L18-5 assume { :end_inline___VERIFIER_assert } true; 404#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 408#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 449#L18 assume !(0 == __VERIFIER_assert_~cond#1); 401#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 402#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 448#L18-5 assume { :end_inline___VERIFIER_assert } true; 447#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 446#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 445#L18 assume !(0 == __VERIFIER_assert_~cond#1); 444#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 443#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 442#L18-5 assume { :end_inline___VERIFIER_assert } true; 441#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 440#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 439#L18 assume !(0 == __VERIFIER_assert_~cond#1); 438#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 437#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 436#L18-5 assume { :end_inline___VERIFIER_assert } true; 435#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 434#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 433#L18 assume !(0 == __VERIFIER_assert_~cond#1); 432#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 431#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 430#L18-5 assume { :end_inline___VERIFIER_assert } true; 429#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 428#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 427#L18 assume !(0 == __VERIFIER_assert_~cond#1); 426#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 425#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 424#L18-5 assume { :end_inline___VERIFIER_assert } true; 423#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 422#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 421#L18 assume !(0 == __VERIFIER_assert_~cond#1); 420#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 419#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 418#L18-5 assume { :end_inline___VERIFIER_assert } true; 417#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 416#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 411#L18 assume !(0 == __VERIFIER_assert_~cond#1); 415#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 414#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 413#L18-5 assume { :end_inline___VERIFIER_assert } true; 412#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 410#L28-3 assume !(main_~j~0#1 < 8); 409#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 406#L27-3 [2022-07-23 15:08:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 15:08:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:57,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234658792] [2022-07-23 15:08:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 811262085, now seen corresponding path program 3 times [2022-07-23 15:08:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:57,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461424614] [2022-07-23 15:08:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,456 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2018441603, now seen corresponding path program 1 times [2022-07-23 15:08:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:57,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046466574] [2022-07-23 15:08:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:57,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:57,968 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:57,969 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:57,969 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:57,969 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:57,969 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:08:57,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:57,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:57,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:57,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2022-07-23 15:08:57,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:57,971 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:57,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:57,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:57,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:57,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,056 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:58,057 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:08:58,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:58,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:58,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 15:08:58,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:58,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=8} Honda state: {ULTIMATE.start_main_~j~0#1=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:58,170 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-07-23 15:08:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 15:08:58,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:58,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:58,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:58,212 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:58,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 15:08:58,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:58,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:58,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 15:08:58,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:08:58,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:58,375 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:08:58,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,379 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:58,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:58,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:58,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:58,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:08:58,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:58,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:58,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration4_Loop [2022-07-23 15:08:58,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:58,389 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:58,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:58,454 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:08:58,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 15:08:58,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:58,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:58,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:58,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:58,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:58,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:58,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:58,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:58,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:58,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,497 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-07-23 15:08:58,498 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-07-23 15:08:58,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:58,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:58,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:58,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:58,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:58,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:58,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:58,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:58,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:58,540 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-07-23 15:08:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,547 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 15:08:58,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:58,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:58,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:58,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:58,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:58,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:58,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:58,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:58,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:08:58,566 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-23 15:08:58,566 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-23 15:08:58,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,569 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 15:08:58,571 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:08:58,571 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:08:58,571 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:08:58,571 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nlen~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nlen~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-23 15:08:58,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,590 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:08:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:58,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:08:58,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:58,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:08:58,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-23 15:08:58,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:08:58,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 54 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:58,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 54 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 104 states and 107 transitions. Complement of second has 4 states. [2022-07-23 15:08:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 15:08:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-07-23 15:08:58,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 51 letters. [2022-07-23 15:08:58,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:58,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 53 letters. Loop has 51 letters. [2022-07-23 15:08:58,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:58,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 102 letters. [2022-07-23 15:08:58,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:58,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 107 transitions. [2022-07-23 15:08:58,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 15:08:58,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 103 states and 106 transitions. [2022-07-23 15:08:58,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-07-23 15:08:58,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-23 15:08:58,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 106 transitions. [2022-07-23 15:08:58,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:08:58,843 INFO L369 hiAutomatonCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-07-23 15:08:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 106 transitions. [2022-07-23 15:08:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 60. [2022-07-23 15:08:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-07-23 15:08:58,847 INFO L392 hiAutomatonCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-07-23 15:08:58,847 INFO L374 stractBuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-07-23 15:08:58,847 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 15:08:58,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 63 transitions. [2022-07-23 15:08:58,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 15:08:58,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:58,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:58,848 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 15:08:58,849 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 15:08:58,849 INFO L752 eck$LassoCheckResult]: Stem: 737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 746#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 748#L28-3 [2022-07-23 15:08:58,849 INFO L754 eck$LassoCheckResult]: Loop: 748#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 733#L18 assume !(0 == __VERIFIER_assert_~cond#1); 734#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 739#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 741#L18-5 assume { :end_inline___VERIFIER_assert } true; 742#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 748#L28-3 [2022-07-23 15:08:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2022-07-23 15:08:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:58,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180247695] [2022-07-23 15:08:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1426785425, now seen corresponding path program 1 times [2022-07-23 15:08:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:58,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608916183] [2022-07-23 15:08:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -181476169, now seen corresponding path program 1 times [2022-07-23 15:08:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:58,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680425632] [2022-07-23 15:08:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:58,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:58,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:58,937 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:58,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:58,937 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:58,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:58,937 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:08:58,937 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,937 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:58,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:58,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2022-07-23 15:08:58,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:58,938 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:58,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:58,972 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:58,972 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:08:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:58,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:58,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 15:08:58,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:58,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:58,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:58,995 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:59,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,013 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 15:08:59,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:59,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,036 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:59,037 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~nlen~0#1=1, ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:59,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,059 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 15:08:59,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:59,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:59,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:59,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 15:08:59,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:59,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,144 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 15:08:59,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:08:59,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,176 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:08:59,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,182 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:59,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:59,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:59,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:59,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:08:59,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:59,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:59,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration5_Loop [2022-07-23 15:08:59,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:59,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:59,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,222 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:59,222 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:08:59,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,223 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 15:08:59,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:59,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,267 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 15:08:59,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:59,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,311 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 15:08:59,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,360 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 15:08:59,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:08:59,382 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:08:59,382 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:08:59,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,400 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 15:08:59,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:08:59,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:08:59,402 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:08:59,403 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2022-07-23 15:08:59,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,419 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:08:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:59,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:08:59,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:08:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:08:59,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:08:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:08:59,468 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:08:59,468 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:59,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 63 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 165 states and 172 transitions. Complement of second has 7 states. [2022-07-23 15:08:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 15:08:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-07-23 15:08:59,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-23 15:08:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:59,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-23 15:08:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:59,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 12 letters. [2022-07-23 15:08:59,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:08:59,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 172 transitions. [2022-07-23 15:08:59,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 15:08:59,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 111 states and 115 transitions. [2022-07-23 15:08:59,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 15:08:59,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 15:08:59,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 115 transitions. [2022-07-23 15:08:59,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 15:08:59,485 INFO L369 hiAutomatonCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-07-23 15:08:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 115 transitions. [2022-07-23 15:08:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 60. [2022-07-23 15:08:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:08:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-23 15:08:59,488 INFO L392 hiAutomatonCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-23 15:08:59,488 INFO L374 stractBuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-23 15:08:59,488 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 15:08:59,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 62 transitions. [2022-07-23 15:08:59,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-23 15:08:59,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:08:59,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:08:59,490 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1] [2022-07-23 15:08:59,490 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 15:08:59,490 INFO L752 eck$LassoCheckResult]: Stem: 1013#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1014#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post3#1, main_#t~post2#1, main_~offset~0#1, main_~length~0#1, main_~nlen~0#1, main_~i~0#1, main_~j~0#1;havoc main_~offset~0#1;havoc main_~length~0#1;main_~nlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 1021#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1022#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1011#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1012#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1016#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1019#L18-5 assume { :end_inline___VERIFIER_assert } true; 1020#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1025#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1068#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1067#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1066#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1065#L18-5 assume { :end_inline___VERIFIER_assert } true; 1064#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1063#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1062#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1061#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1060#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1059#L18-5 assume { :end_inline___VERIFIER_assert } true; 1058#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1057#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1056#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1055#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1054#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1053#L18-5 assume { :end_inline___VERIFIER_assert } true; 1052#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1051#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1050#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1049#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1048#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1047#L18-5 assume { :end_inline___VERIFIER_assert } true; 1046#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1045#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1044#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1043#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1042#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1041#L18-5 assume { :end_inline___VERIFIER_assert } true; 1040#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1039#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1038#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1037#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1036#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1035#L18-5 assume { :end_inline___VERIFIER_assert } true; 1034#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1033#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1028#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1032#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1031#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1030#L18-5 assume { :end_inline___VERIFIER_assert } true; 1029#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1027#L28-3 assume !(main_~j~0#1 < 8); 1026#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1023#L27-3 assume !!(main_~i~0#1 < main_~nlen~0#1);main_~j~0#1 := 0; 1024#L28-3 [2022-07-23 15:08:59,490 INFO L754 eck$LassoCheckResult]: Loop: 1024#L28-3 assume !!(main_~j~0#1 < 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~nlen~0#1 - 1 - main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1009#L18 assume !(0 == __VERIFIER_assert_~cond#1); 1010#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~nlen~0#1 - 1 - main_~i~0#1 < main_~nlen~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1015#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 1017#L18-5 assume { :end_inline___VERIFIER_assert } true; 1018#L28-2 main_#t~post3#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1024#L28-3 [2022-07-23 15:08:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1852819737, now seen corresponding path program 2 times [2022-07-23 15:08:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135738817] [2022-07-23 15:08:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1426785425, now seen corresponding path program 2 times [2022-07-23 15:08:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:59,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224065018] [2022-07-23 15:08:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:08:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1846282505, now seen corresponding path program 3 times [2022-07-23 15:08:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:08:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275531463] [2022-07-23 15:08:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:08:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:08:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:08:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:08:59,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:08:59,578 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:59,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:59,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:59,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:59,579 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:08:59,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:59,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:59,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2022-07-23 15:08:59,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:59,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:59,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,612 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:59,612 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:08:59,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,614 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 15:08:59,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:59,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-23 15:08:59,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3#1=0} Honda state: {ULTIMATE.start_main_#t~post3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-23 15:08:59,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,660 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 15:08:59,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:08:59,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,702 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 15:08:59,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:08:59,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:08:59,791 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:08:59,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,800 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:08:59,800 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:08:59,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:08:59,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:08:59,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:08:59,800 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:08:59,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:08:59,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: id_build.i_Iteration6_Loop [2022-07-23 15:08:59,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:08:59,800 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:08:59,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:08:59,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,871 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:08:59,871 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:08:59,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,888 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 15:08:59,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:08:59,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,934 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:08:59,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:08:59,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:08:59,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:08:59,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:08:59,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:08:59,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:08:59,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:08:59,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 15:08:59,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:08:59,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:08:59,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:08:59,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:08:59,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:08:59,966 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:08:59,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 15:08:59,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:08:59,968 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:08:59,968 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:08:59,968 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 15 Supporting invariants [] [2022-07-23 15:08:59,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 15:08:59,987 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:08:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:09:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:09:00,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:09:00,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 158 transitions. Complement of second has 7 states. [2022-07-23 15:09:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 15:09:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-07-23 15:09:00,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 54 letters. Loop has 6 letters. [2022-07-23 15:09:00,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:09:00,120 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 15:09:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:09:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:09:00,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:09:00,209 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 158 transitions. Complement of second has 7 states. [2022-07-23 15:09:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 15:09:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-07-23 15:09:00,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 54 letters. Loop has 6 letters. [2022-07-23 15:09:00,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:09:00,232 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 15:09:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:09:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:09:00,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:09:00,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:09:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:09:00,315 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 15:09:00,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 62 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 108 states and 112 transitions. Complement of second has 6 states. [2022-07-23 15:09:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 15:09:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:09:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-07-23 15:09:00,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 54 letters. Loop has 6 letters. [2022-07-23 15:09:00,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:09:00,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 60 letters. Loop has 6 letters. [2022-07-23 15:09:00,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:09:00,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 54 letters. Loop has 12 letters. [2022-07-23 15:09:00,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:09:00,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 112 transitions. [2022-07-23 15:09:00,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:09:00,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:09:00,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:09:00,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:09:00,327 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 15:09:00,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 15:09:00,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:09:00,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 15:09:00,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 03:09:00 BoogieIcfgContainer [2022-07-23 15:09:00,332 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 15:09:00,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 15:09:00,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 15:09:00,333 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 15:09:00,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:08:56" (3/4) ... [2022-07-23 15:09:00,335 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 15:09:00,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 15:09:00,336 INFO L158 Benchmark]: Toolchain (without parser) took 4310.03ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 54.9MB in the beginning and 41.9MB in the end (delta: 13.0MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,336 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 41.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:09:00,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.60ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 53.9MB in the end (delta: 844.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.99ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 52.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,337 INFO L158 Benchmark]: Boogie Preprocessor took 11.02ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 51.5MB in the end (delta: 993.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,337 INFO L158 Benchmark]: RCFGBuilder took 234.17ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 42.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,337 INFO L158 Benchmark]: BuchiAutomizer took 3856.09ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 42.7MB in the beginning and 43.0MB in the end (delta: -297.1kB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,337 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 113.2MB. Free memory was 42.9MB in the beginning and 41.9MB in the end (delta: 989.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:09:00,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 41.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.60ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 53.9MB in the end (delta: 844.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.99ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 52.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.02ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 51.5MB in the end (delta: 993.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.17ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 42.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3856.09ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 42.7MB in the beginning and 43.0MB in the end (delta: -297.1kB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 113.2MB. Free memory was 42.9MB in the beginning and 41.9MB in the end (delta: 989.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + nlen and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 7 iterations. TraceHistogramMax:8. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 99 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 176/176 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 84 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq133 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 15:09:00,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 15:09:00,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 15:09:00,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 15:09:00,979 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 Writing output log to file Ultimate.log Result: TRUE