./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_vararg_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/standard_vararg_ground.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 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:04,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:04,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:04,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:04,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:04,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:04,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:04,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:04,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:04,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:04,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:04,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:04,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:04,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:04,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:04,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:04,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:04,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:04,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:04,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:04,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:04,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:04,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:04,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:04,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:04,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:04,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:04,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:04,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:04,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:04,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:04,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:04,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:04,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:04,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:04,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:04,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:04,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:04,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:04,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:04,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:04,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:04,623 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:04,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:04,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:04,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:04,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:04,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:04,626 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:04,626 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:04,626 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:04,626 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:04,627 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:04,627 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:04,627 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:04,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:04,628 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:04,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:04,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:04,629 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:04,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:04,630 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:04,630 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:04,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:04,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:04,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:04,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:04,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:04,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:04,632 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:04,632 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 -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2021-12-15 17:06:04,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:04,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:04,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:04,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:04,867 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:04,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_vararg_ground.i [2021-12-15 17:06:04,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c378ac10c/1895be9c29704238b4995cdb2a3bc312/FLAG77eba598a [2021-12-15 17:06:05,377 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:05,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2021-12-15 17:06:05,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c378ac10c/1895be9c29704238b4995cdb2a3bc312/FLAG77eba598a [2021-12-15 17:06:05,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c378ac10c/1895be9c29704238b4995cdb2a3bc312 [2021-12-15 17:06:05,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:05,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:05,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:05,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:05,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:05,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:05,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322afa3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05, skipping insertion in model container [2021-12-15 17:06:05,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:05,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:05,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:05,926 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/array-examples/standard_vararg_ground.i[815,828] [2021-12-15 17:06:05,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:05,964 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:05,977 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/array-examples/standard_vararg_ground.i[815,828] [2021-12-15 17:06:05,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:05,998 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:05,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05 WrapperNode [2021-12-15 17:06:05,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:06,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:06,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:06,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:06,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,039 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2021-12-15 17:06:06,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:06,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:06,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:06,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:06,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:06,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:06,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:06,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:06,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (1/1) ... [2021-12-15 17:06:06,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:06,098 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) [2021-12-15 17:06:06,101 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 [2021-12-15 17:06:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:06:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:06:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:06,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:06:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:06:06,176 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:06,177 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:06,315 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:06,320 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:06,320 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 17:06:06,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:06 BoogieIcfgContainer [2021-12-15 17:06:06,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:06,323 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:06,323 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:06,329 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:06,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:06,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:05" (1/3) ... [2021-12-15 17:06:06,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2859fdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:06, skipping insertion in model container [2021-12-15 17:06:06,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:06,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:05" (2/3) ... [2021-12-15 17:06:06,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2859fdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:06, skipping insertion in model container [2021-12-15 17:06:06,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:06,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:06" (3/3) ... [2021-12-15 17:06:06,333 INFO L388 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2021-12-15 17:06:06,404 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:06,404 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:06,404 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:06,404 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:06,404 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:06,405 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:06,405 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:06,405 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:06,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:06,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-15 17:06:06,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:06,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:06,446 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:06,446 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:06,447 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:06,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:06,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-15 17:06:06,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:06,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:06,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:06,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:06,457 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 15#L20-3true [2021-12-15 17:06:06,458 INFO L793 eck$LassoCheckResult]: Loop: 15#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 16#L20-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 15#L20-3true [2021-12-15 17:06:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:06,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:06,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945550809] [2021-12-15 17:06:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:06,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-15 17:06:06,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:06,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040707108] [2021-12-15 17:06:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:06,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-15 17:06:06,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:06,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901931427] [2021-12-15 17:06:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:06,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:06,739 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:07,135 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:06:07,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:06:07,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:06:07,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:06:07,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:06:07,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:06:07,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:06:07,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2021-12-15 17:06:07,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:06:07,137 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:06:07,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:06:07,543 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:06:07,550 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:06:07,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:07,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:06:07,557 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 [2021-12-15 17:06:07,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:07,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:07,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:07,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-15 17:06:07,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:07,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:06:07,633 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 [2021-12-15 17:06:07,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:07,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:07,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:07,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:07,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:06:07,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,682 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) [2021-12-15 17:06:07,696 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 [2021-12-15 17:06:07,696 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 [2021-12-15 17:06:07,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:07,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:07,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:07,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-15 17:06:07,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,915 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) [2021-12-15 17:06:07,915 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 [2021-12-15 17:06:07,917 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 [2021-12-15 17:06:07,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:07,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:07,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:07,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:07,948 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 [2021-12-15 17:06:07,948 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,949 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) [2021-12-15 17:06:07,951 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 [2021-12-15 17:06:07,952 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 [2021-12-15 17:06:07,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:07,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:07,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:07,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:07,977 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 [2021-12-15 17:06:07,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:07,978 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) [2021-12-15 17:06:07,979 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 [2021-12-15 17:06:07,981 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 [2021-12-15 17:06:07,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:07,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:07,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:07,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:07,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:07,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:07,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,009 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 [2021-12-15 17:06:08,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,011 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) [2021-12-15 17:06:08,013 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 [2021-12-15 17:06:08,013 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 [2021-12-15 17:06:08,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:08,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:08,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:08,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,056 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 [2021-12-15 17:06:08,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,058 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) [2021-12-15 17:06:08,059 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 [2021-12-15 17:06:08,060 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 [2021-12-15 17:06:08,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:08,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:08,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:08,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-15 17:06:08,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,088 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) [2021-12-15 17:06:08,089 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 [2021-12-15 17:06:08,093 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 [2021-12-15 17:06:08,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:08,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:08,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:08,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,149 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 [2021-12-15 17:06:08,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,150 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) [2021-12-15 17:06:08,151 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 [2021-12-15 17:06:08,152 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 [2021-12-15 17:06:08,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,197 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 [2021-12-15 17:06:08,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,199 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) [2021-12-15 17:06:08,203 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 [2021-12-15 17:06:08,204 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 [2021-12-15 17:06:08,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,246 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 [2021-12-15 17:06:08,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,247 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) [2021-12-15 17:06:08,250 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 [2021-12-15 17:06:08,251 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 [2021-12-15 17:06:08,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,299 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 [2021-12-15 17:06:08,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,300 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) [2021-12-15 17:06:08,306 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 [2021-12-15 17:06:08,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,320 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 [2021-12-15 17:06:08,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,369 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 [2021-12-15 17:06:08,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,371 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) [2021-12-15 17:06:08,378 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 [2021-12-15 17:06:08,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,392 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 [2021-12-15 17:06:08,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,421 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 [2021-12-15 17:06:08,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,422 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) [2021-12-15 17:06:08,423 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 [2021-12-15 17:06:08,424 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 [2021-12-15 17:06:08,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,476 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 [2021-12-15 17:06:08,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,477 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) [2021-12-15 17:06:08,479 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 [2021-12-15 17:06:08,481 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 [2021-12-15 17:06:08,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,541 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 [2021-12-15 17:06:08,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,543 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) [2021-12-15 17:06:08,546 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 [2021-12-15 17:06:08,547 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 [2021-12-15 17:06:08,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,581 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 [2021-12-15 17:06:08,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,582 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) [2021-12-15 17:06:08,595 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 [2021-12-15 17:06:08,595 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 [2021-12-15 17:06:08,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,631 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 [2021-12-15 17:06:08,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,632 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) [2021-12-15 17:06:08,637 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 [2021-12-15 17:06:08,638 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 [2021-12-15 17:06:08,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:08,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:08,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:08,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-15 17:06:08,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,668 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) [2021-12-15 17:06:08,669 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 [2021-12-15 17:06:08,670 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 [2021-12-15 17:06:08,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:06:08,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:06:08,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:06:08,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:06:08,722 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 [2021-12-15 17:06:08,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,724 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) [2021-12-15 17:06:08,724 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 [2021-12-15 17:06:08,726 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 [2021-12-15 17:06:08,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:06:08,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:06:08,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:06:08,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:06:08,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:06:08,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:06:08,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:06:08,774 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:06:08,774 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-15 17:06:08,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,787 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) [2021-12-15 17:06:08,796 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:06:08,804 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 [2021-12-15 17:06:08,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:06:08,817 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:06:08,817 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1 Supporting invariants [] [2021-12-15 17:06:08,873 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 [2021-12-15 17:06:08,883 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-12-15 17:06:08,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:08,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:06:08,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:08,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:06:08,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:08,996 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 [2021-12-15 17:06:08,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-15 17:06:09,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 40 states and 56 transitions. Complement of second has 8 states. [2021-12-15 17:06:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:06:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2021-12-15 17:06:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-15 17:06:09,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-15 17:06:09,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:06:09,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:06:09,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:06:09,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-15 17:06:09,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:06:09,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2021-12-15 17:06:09,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 13 states and 16 transitions. [2021-12-15 17:06:09,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:09,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:06:09,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-15 17:06:09,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:09,080 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-15 17:06:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-15 17:06:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-15 17:06:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-15 17:06:09,101 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:06:09,101 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-15 17:06:09,101 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:09,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-15 17:06:09,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,102 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:06:09,102 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:09,102 INFO L791 eck$LassoCheckResult]: Stem: 118#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(25, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 123#L20-3 assume !(main_~i~0#1 < 100000); 116#L25-2 [2021-12-15 17:06:09,102 INFO L793 eck$LassoCheckResult]: Loop: 116#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 117#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116#L25-2 [2021-12-15 17:06:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2021-12-15 17:06:09,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666831273] [2021-12-15 17:06:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666831273] [2021-12-15 17:06:09,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666831273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:09,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:09,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:06:09,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38167069] [2021-12-15 17:06:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:09,135 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2021-12-15 17:06:09,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099400173] [2021-12-15 17:06:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,144 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:09,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:09,177 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2021-12-15 17:06:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:09,186 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-12-15 17:06:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:09,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2021-12-15 17:06:09,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2021-12-15 17:06:09,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:09,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:09,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2021-12-15 17:06:09,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:09,189 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-15 17:06:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2021-12-15 17:06:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-15 17:06:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-12-15 17:06:09,191 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-12-15 17:06:09,191 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-12-15 17:06:09,191 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:09,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2021-12-15 17:06:09,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:06:09,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:09,193 INFO L791 eck$LassoCheckResult]: Stem: 149#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(25, 2); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 154#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 155#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 156#L20-3 assume !(main_~i~0#1 < 100000); 147#L25-2 [2021-12-15 17:06:09,193 INFO L793 eck$LassoCheckResult]: Loop: 147#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 148#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 147#L25-2 [2021-12-15 17:06:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2021-12-15 17:06:09,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35821632] [2021-12-15 17:06:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35821632] [2021-12-15 17:06:09,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35821632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212300522] [2021-12-15 17:06:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:09,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:09,219 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:09,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-15 17:06:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 17:06:09,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:06:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212300522] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:06:09,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:06:09,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-12-15 17:06:09,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014306910] [2021-12-15 17:06:09,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:06:09,296 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times [2021-12-15 17:06:09,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955137488] [2021-12-15 17:06:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,305 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:09,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:06:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:06:09,334 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-12-15 17:06:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:09,359 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-12-15 17:06:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:06:09,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-12-15 17:06:09,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2021-12-15 17:06:09,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:09,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:09,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2021-12-15 17:06:09,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:09,362 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-15 17:06:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2021-12-15 17:06:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-15 17:06:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 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) [2021-12-15 17:06:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-15 17:06:09,364 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-15 17:06:09,364 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-15 17:06:09,364 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:09,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2021-12-15 17:06:09,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2021-12-15 17:06:09,365 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:09,366 INFO L791 eck$LassoCheckResult]: Stem: 213#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(25, 2); 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 218#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 219#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 220#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 221#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 228#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 227#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 226#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 225#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 224#L20-3 assume !(main_~i~0#1 < 100000); 211#L25-2 [2021-12-15 17:06:09,366 INFO L793 eck$LassoCheckResult]: Loop: 211#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 212#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 211#L25-2 [2021-12-15 17:06:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2021-12-15 17:06:09,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274796019] [2021-12-15 17:06:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274796019] [2021-12-15 17:06:09,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274796019] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897472116] [2021-12-15 17:06:09,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:06:09,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:09,439 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:09,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-15 17:06:09,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:06:09,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:06:09,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:06:09,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:06:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897472116] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:06:09,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:06:09,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-15 17:06:09,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840375406] [2021-12-15 17:06:09,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:06:09,599 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times [2021-12-15 17:06:09,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673989155] [2021-12-15 17:06:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,618 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:09,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 17:06:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:06:09,671 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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) [2021-12-15 17:06:09,691 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 [2021-12-15 17:06:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:09,715 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-12-15 17:06:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 17:06:09,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2021-12-15 17:06:09,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 17:06:09,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:09,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:09,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2021-12-15 17:06:09,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:09,720 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 17:06:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2021-12-15 17:06:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 17:06:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 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) [2021-12-15 17:06:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 17:06:09,727 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 17:06:09,727 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 17:06:09,727 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:09,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2021-12-15 17:06:09,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:09,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,729 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2021-12-15 17:06:09,729 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:09,729 INFO L791 eck$LassoCheckResult]: Stem: 340#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(25, 2); 341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 344#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 345#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 346#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 342#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 343#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 364#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 363#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 362#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 361#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 360#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 359#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 358#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 357#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 356#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 355#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 354#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 353#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 352#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 351#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 350#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 349#L20-3 assume !(main_~i~0#1 < 100000); 335#L25-2 [2021-12-15 17:06:09,729 INFO L793 eck$LassoCheckResult]: Loop: 335#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 336#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 335#L25-2 [2021-12-15 17:06:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2021-12-15 17:06:09,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192621757] [2021-12-15 17:06:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192621757] [2021-12-15 17:06:09,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192621757] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049027291] [2021-12-15 17:06:09,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:06:09,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:09,900 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:09,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-15 17:06:10,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-15 17:06:10,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:06:10,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:06:10,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:06:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049027291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:06:10,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:06:10,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2021-12-15 17:06:10,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765481877] [2021-12-15 17:06:10,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:06:10,302 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times [2021-12-15 17:06:10,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207822323] [2021-12-15 17:06:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:10,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:10,310 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:10,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 17:06:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-12-15 17:06:10,343 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 5 Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 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) [2021-12-15 17:06:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:10,410 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2021-12-15 17:06:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 17:06:10,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2021-12-15 17:06:10,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:10,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 56 transitions. [2021-12-15 17:06:10,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:10,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:10,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2021-12-15 17:06:10,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:10,413 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-15 17:06:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2021-12-15 17:06:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-15 17:06:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 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) [2021-12-15 17:06:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-15 17:06:10,417 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-15 17:06:10,417 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-15 17:06:10,417 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:10,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 56 transitions. [2021-12-15 17:06:10,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:10,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:10,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:10,419 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1] [2021-12-15 17:06:10,419 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:10,419 INFO L791 eck$LassoCheckResult]: Stem: 581#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(25, 2); 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 586#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 587#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 589#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 632#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 631#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 630#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 629#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 628#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 627#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 626#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 625#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 624#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 623#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 622#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 620#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 619#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 618#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 617#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 616#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 615#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 614#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 613#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 612#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 611#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 610#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 609#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 608#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 607#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 606#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 605#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 604#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 603#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 602#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 601#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 600#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 599#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 598#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 597#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 596#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 595#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 594#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 593#L20-3 assume !(main_~i~0#1 < 100000); 579#L25-2 [2021-12-15 17:06:10,419 INFO L793 eck$LassoCheckResult]: Loop: 579#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 580#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 579#L25-2 [2021-12-15 17:06:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash -111832455, now seen corresponding path program 4 times [2021-12-15 17:06:10,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000341095] [2021-12-15 17:06:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000341095] [2021-12-15 17:06:10,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000341095] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579400667] [2021-12-15 17:06:10,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:06:10,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:10,747 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:10,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-15 17:06:10,837 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:06:10,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:06:10,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 17:06:10,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:06:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:11,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579400667] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:06:11,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:06:11,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2021-12-15 17:06:11,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355246770] [2021-12-15 17:06:11,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:06:11,639 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times [2021-12-15 17:06:11,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:11,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926681442] [2021-12-15 17:06:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:11,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:11,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:11,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:11,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:11,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 17:06:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-12-15 17:06:11,686 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. cyclomatic complexity: 5 Second operand has 49 states, 48 states have (on average 2.0) internal successors, (96), 49 states have internal predecessors, (96), 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) [2021-12-15 17:06:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:11,839 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2021-12-15 17:06:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-15 17:06:11,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 104 transitions. [2021-12-15 17:06:11,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:11,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 104 transitions. [2021-12-15 17:06:11,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:11,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:11,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2021-12-15 17:06:11,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:11,844 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2021-12-15 17:06:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2021-12-15 17:06:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-15 17:06:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 101 states have internal predecessors, (104), 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) [2021-12-15 17:06:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2021-12-15 17:06:11,849 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2021-12-15 17:06:11,849 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2021-12-15 17:06:11,849 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:06:11,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 104 transitions. [2021-12-15 17:06:11,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:11,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:11,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:11,852 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1] [2021-12-15 17:06:11,852 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:11,853 INFO L791 eck$LassoCheckResult]: Stem: 1068#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(25, 2); 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 1072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1073#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1070#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1071#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1164#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1163#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1162#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1161#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1160#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1159#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1158#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1157#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1156#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1155#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1154#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1152#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1150#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1149#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1148#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1147#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1146#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1144#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1143#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1142#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1140#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1139#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1138#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1137#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1136#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1135#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1134#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1133#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1132#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1131#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1130#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1129#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1128#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1126#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1125#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1124#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1122#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1121#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1120#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1119#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1118#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1117#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1116#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1115#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1114#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1113#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1112#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1111#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1110#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1108#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1107#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1106#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1104#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1103#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1102#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1101#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1100#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1099#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1098#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1097#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1096#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1095#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1094#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1093#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1092#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1090#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1089#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1088#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1086#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1085#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1084#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1083#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1082#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1081#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1080#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1079#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1078#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1077#L20-3 assume !(main_~i~0#1 < 100000); 1063#L25-2 [2021-12-15 17:06:11,853 INFO L793 eck$LassoCheckResult]: Loop: 1063#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 1064#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1063#L25-2 [2021-12-15 17:06:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1497227703, now seen corresponding path program 5 times [2021-12-15 17:06:11,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490760427] [2021-12-15 17:06:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:11,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:12,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:12,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490760427] [2021-12-15 17:06:12,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490760427] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:12,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18583153] [2021-12-15 17:06:12,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 17:06:12,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:12,856 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:12,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-15 17:06:42,406 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-12-15 17:06:42,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:06:42,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 17:06:42,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:06:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:42,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:06:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:45,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18583153] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:06:45,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:06:45,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2021-12-15 17:06:45,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885378875] [2021-12-15 17:06:45,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:06:45,023 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 6 times [2021-12-15 17:06:45,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:45,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961779007] [2021-12-15 17:06:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:45,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:45,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:45,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:45,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:45,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-12-15 17:06:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2021-12-15 17:06:45,063 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. cyclomatic complexity: 5 Second operand has 97 states, 96 states have (on average 2.0) internal successors, (192), 97 states have internal predecessors, (192), 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) [2021-12-15 17:06:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:45,373 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2021-12-15 17:06:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-15 17:06:45,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 200 transitions. [2021-12-15 17:06:45,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:45,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 200 transitions. [2021-12-15 17:06:45,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:06:45,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:06:45,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 200 transitions. [2021-12-15 17:06:45,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:45,391 INFO L681 BuchiCegarLoop]: Abstraction has 198 states and 200 transitions. [2021-12-15 17:06:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 200 transitions. [2021-12-15 17:06:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-15 17:06:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.0101010101010102) internal successors, (200), 197 states have internal predecessors, (200), 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) [2021-12-15 17:06:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2021-12-15 17:06:45,406 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 200 transitions. [2021-12-15 17:06:45,406 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 200 transitions. [2021-12-15 17:06:45,406 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:06:45,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 200 transitions. [2021-12-15 17:06:45,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:06:45,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:45,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:45,413 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1] [2021-12-15 17:06:45,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:06:45,417 INFO L791 eck$LassoCheckResult]: Stem: 2029#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(25, 2); 2030#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 2034#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2035#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2036#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2037#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2038#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2224#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2223#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2222#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2221#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2220#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2219#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2218#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2217#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2216#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2215#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2214#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2213#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2212#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2211#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2210#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2209#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2208#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2207#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2206#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2205#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2204#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2203#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2202#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2201#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2200#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2199#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2198#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2197#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2196#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2195#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2194#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2193#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2192#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2191#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2190#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2189#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2188#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2187#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2186#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2185#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2184#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2183#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2182#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2181#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2180#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2179#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2178#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2177#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2176#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2175#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2174#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2173#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2172#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2171#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2170#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2169#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2168#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2167#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2166#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2165#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2164#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2163#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2162#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2161#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2160#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2159#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2158#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2157#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2156#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2155#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2154#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2152#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2150#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2149#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2148#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2147#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2146#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2144#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2143#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2142#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2140#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2139#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2138#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2137#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2136#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2135#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2134#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2133#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2132#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2131#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2130#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2129#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2128#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2126#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2125#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2124#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2122#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2121#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2120#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2119#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2118#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2117#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2116#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2115#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2114#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2113#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2112#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2111#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2110#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2108#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2107#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2106#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2104#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2103#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2102#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2101#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2100#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2099#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2098#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2097#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2096#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2095#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2094#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2093#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2092#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2090#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2089#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2088#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2086#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2085#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2084#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2083#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2082#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2081#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2080#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2079#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2078#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2077#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2076#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2075#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2074#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2073#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2072#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2071#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2070#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2069#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2068#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2067#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2066#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2065#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2064#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2063#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2062#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2061#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2060#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2059#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2058#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2057#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2056#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2055#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2054#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2053#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2052#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2051#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2050#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2049#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2048#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2047#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2046#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2045#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2044#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2043#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2042#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2041#L20-3 assume !(main_~i~0#1 < 100000); 2027#L25-2 [2021-12-15 17:06:45,421 INFO L793 eck$LassoCheckResult]: Loop: 2027#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 2028#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2027#L25-2 [2021-12-15 17:06:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2115802601, now seen corresponding path program 6 times [2021-12-15 17:06:45,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:45,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337428576] [2021-12-15 17:06:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:45,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:48,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:48,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337428576] [2021-12-15 17:06:48,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337428576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:06:48,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338071372] [2021-12-15 17:06:48,525 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 17:06:48,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:06:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:48,527 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:06:48,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process