./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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/reducercommutativity/sep05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1dceb134ad462d5f95d7af7b0695951aa1c5481 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 05:19:02,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 05:19:02,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 05:19:02,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 05:19:02,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 05:19:02,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 05:19:02,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 05:19:02,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 05:19:02,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 05:19:02,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 05:19:02,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 05:19:02,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 05:19:02,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 05:19:02,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 05:19:02,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 05:19:02,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 05:19:02,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 05:19:02,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 05:19:02,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 05:19:02,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 05:19:02,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 05:19:02,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 05:19:02,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 05:19:02,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 05:19:02,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 05:19:02,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 05:19:02,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 05:19:02,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 05:19:02,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 05:19:02,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 05:19:02,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 05:19:02,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 05:19:02,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 05:19:02,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 05:19:02,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 05:19:02,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 05:19:02,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 05:19:02,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 05:19:02,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 05:19:02,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 05:19:02,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 05:19:02,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 05:19:02,270 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 05:19:02,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 05:19:02,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 05:19:02,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 05:19:02,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 05:19:02,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 05:19:02,273 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 05:19:02,273 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 05:19:02,273 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 05:19:02,273 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 05:19:02,274 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 05:19:02,274 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 05:19:02,274 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 05:19:02,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 05:19:02,274 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 05:19:02,275 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 05:19:02,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 05:19:02,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 05:19:02,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 05:19:02,280 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 05:19:02,281 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 05:19:02,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 05:19:02,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 05:19:02,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 05:19:02,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 05:19:02,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 05:19:02,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 05:19:02,283 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 05:19:02,283 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 -> b1dceb134ad462d5f95d7af7b0695951aa1c5481 [2021-08-31 05:19:02,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 05:19:02,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 05:19:02,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 05:19:02,575 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 05:19:02,576 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 05:19:02,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-08-31 05:19:02,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d683fd1/a26694f9ed0747458c3f60766afc177f/FLAG77e713d8b [2021-08-31 05:19:03,017 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 05:19:03,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-08-31 05:19:03,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d683fd1/a26694f9ed0747458c3f60766afc177f/FLAG77e713d8b [2021-08-31 05:19:03,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d683fd1/a26694f9ed0747458c3f60766afc177f [2021-08-31 05:19:03,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 05:19:03,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 05:19:03,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 05:19:03,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 05:19:03,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 05:19:03,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33784bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03, skipping insertion in model container [2021-08-31 05:19:03,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 05:19:03,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 05:19:03,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i[1287,1300] [2021-08-31 05:19:03,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:19:03,206 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 05:19:03,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i[1287,1300] [2021-08-31 05:19:03,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 05:19:03,237 INFO L208 MainTranslator]: Completed translation [2021-08-31 05:19:03,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03 WrapperNode [2021-08-31 05:19:03,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 05:19:03,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 05:19:03,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 05:19:03,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 05:19:03,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 05:19:03,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 05:19:03,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 05:19:03,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 05:19:03,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 05:19:03,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 05:19:03,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 05:19:03,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 05:19:03,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (1/1) ... [2021-08-31 05:19:03,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:03,339 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-08-31 05:19:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 05:19:03,353 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-08-31 05:19:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 05:19:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-31 05:19:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 05:19:03,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 05:19:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-31 05:19:03,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-31 05:19:03,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 05:19:03,533 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-08-31 05:19:03,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:19:03 BoogieIcfgContainer [2021-08-31 05:19:03,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 05:19:03,535 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 05:19:03,535 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 05:19:03,537 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 05:19:03,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:19:03,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 05:19:03" (1/3) ... [2021-08-31 05:19:03,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32254521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:19:03, skipping insertion in model container [2021-08-31 05:19:03,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:19:03,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 05:19:03" (2/3) ... [2021-08-31 05:19:03,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32254521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 05:19:03, skipping insertion in model container [2021-08-31 05:19:03,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 05:19:03,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 05:19:03" (3/3) ... [2021-08-31 05:19:03,539 INFO L389 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2021-08-31 05:19:03,581 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 05:19:03,581 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 05:19:03,581 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 05:19:03,582 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 05:19:03,582 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 05:19:03,582 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 05:19:03,582 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 05:19:03,582 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 05:19:03,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-08-31 05:19:03,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:19:03,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:03,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:03,604 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:19:03,604 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:19:03,604 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 05:19:03,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-08-31 05:19:03,606 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-08-31 05:19:03,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:03,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:03,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-31 05:19:03,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:19:03,612 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 27#L37-3true [2021-08-31 05:19:03,612 INFO L793 eck$LassoCheckResult]: Loop: 27#L37-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 18#L37-2true main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 27#L37-3true [2021-08-31 05:19:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-31 05:19:03,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:03,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573803608] [2021-08-31 05:19:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:03,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,677 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,706 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-31 05:19:03,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:03,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433375616] [2021-08-31 05:19:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:03,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,727 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,738 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-31 05:19:03,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:03,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157974699] [2021-08-31 05:19:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:03,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,758 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:03,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:04,160 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:04,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:04,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:04,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:04,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:04,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:04,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:04,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2021-08-31 05:19:04,162 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:04,162 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:04,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,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-08-31 05:19:04,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:04,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:04,539 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:19:04,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,545 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-08-31 05:19:04,549 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-08-31 05:19:04,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 05:19:04,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 05:19:04,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,595 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-08-31 05:19:04,596 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-08-31 05:19:04,597 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-08-31 05:19:04,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:04,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:04,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:04,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,629 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-08-31 05:19:04,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,630 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-08-31 05:19:04,631 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-08-31 05:19:04,632 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-08-31 05:19:04,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:04,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,695 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-08-31 05:19:04,697 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-08-31 05:19:04,699 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-08-31 05:19:04,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,744 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-08-31 05:19:04,744 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,745 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-08-31 05:19:04,746 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-08-31 05:19:04,748 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-08-31 05:19:04,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:04,784 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-08-31 05:19:04,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,785 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-08-31 05:19:04,786 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-08-31 05:19:04,788 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-08-31 05:19:04,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:04,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:04,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:04,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:04,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:04,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:04,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:19:04,848 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-31 05:19:04,848 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-31 05:19:04,849 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:04,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:04,850 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-08-31 05:19:04,851 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-08-31 05:19:04,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:19:04,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:19:04,874 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:19:04,874 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2021-08-31 05:19:04,891 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-08-31 05:19:04,903 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-31 05:19:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:04,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:19:04,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:04,953 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:04,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,014 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-08-31 05:19:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,044 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-08-31 05:19:05,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-08-31 05:19:05,175 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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 75 states and 110 transitions. Complement of second has 8 states. [2021-08-31 05:19:05,176 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-08-31 05:19:05,181 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-08-31 05:19:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2021-08-31 05:19:05,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-31 05:19:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-31 05:19:05,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-31 05:19:05,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:05,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2021-08-31 05:19:05,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2021-08-31 05:19:05,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-31 05:19:05,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:19:05,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-08-31 05:19:05,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:05,199 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-31 05:19:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-08-31 05:19:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-31 05:19:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-08-31 05:19:05,215 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-31 05:19:05,215 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-08-31 05:19:05,215 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 05:19:05,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2021-08-31 05:19:05,216 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,217 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 05:19:05,217 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,217 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 174#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 182#L37-3 assume !(main_~i~1 < 5); 187#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 188#L18-3 [2021-08-31 05:19:05,217 INFO L793 eck$LassoCheckResult]: Loop: 188#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 191#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 189#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 188#L18-3 [2021-08-31 05:19:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-31 05:19:05,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547516624] [2021-08-31 05:19:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:05,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547516624] [2021-08-31 05:19:05,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547516624] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:05,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:19:05,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:19:05,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929311683] [2021-08-31 05:19:05,270 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-08-31 05:19:05,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286471782] [2021-08-31 05:19:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,292 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,300 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:19:05,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:19:05,357 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 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-08-31 05:19:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:05,410 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2021-08-31 05:19:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:19:05,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2021-08-31 05:19:05,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2021-08-31 05:19:05,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:19:05,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:19:05,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2021-08-31 05:19:05,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:05,413 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-08-31 05:19:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2021-08-31 05:19:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-31 05:19:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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-08-31 05:19:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2021-08-31 05:19:05,415 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-08-31 05:19:05,415 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-08-31 05:19:05,415 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 05:19:05,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2021-08-31 05:19:05,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 05:19:05,416 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,417 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 225#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 233#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 222#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 223#L37-3 assume !(main_~i~1 < 5); 238#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 239#L18-3 [2021-08-31 05:19:05,417 INFO L793 eck$LassoCheckResult]: Loop: 239#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 242#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 240#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 239#L18-3 [2021-08-31 05:19:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-08-31 05:19:05,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481424663] [2021-08-31 05:19:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:05,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481424663] [2021-08-31 05:19:05,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481424663] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:05,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255775044] [2021-08-31 05:19:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:05,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:05,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-31 05:19:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:19:05,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:19:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255775044] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:19:05,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:19:05,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-31 05:19:05,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153038050] [2021-08-31 05:19:05,528 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-08-31 05:19:05,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995878955] [2021-08-31 05:19:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,533 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:19:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:19:05,575 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:05,642 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2021-08-31 05:19:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:19:05,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2021-08-31 05:19:05,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2021-08-31 05:19:05,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:19:05,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:19:05,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2021-08-31 05:19:05,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:05,644 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-31 05:19:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2021-08-31 05:19:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-31 05:19:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 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-08-31 05:19:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-31 05:19:05,646 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-31 05:19:05,646 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-31 05:19:05,646 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 05:19:05,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-08-31 05:19:05,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-08-31 05:19:05,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,647 INFO L791 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 315#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 323#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 312#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 313#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 334#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 339#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 338#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 337#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 336#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 335#L37-3 assume !(main_~i~1 < 5); 328#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 329#L18-3 [2021-08-31 05:19:05,647 INFO L793 eck$LassoCheckResult]: Loop: 329#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 332#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 330#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 329#L18-3 [2021-08-31 05:19:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-08-31 05:19:05,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498085412] [2021-08-31 05:19:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:05,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498085412] [2021-08-31 05:19:05,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498085412] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:05,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234768020] [2021-08-31 05:19:05,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 05:19:05,692 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:05,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:05,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:05,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-31 05:19:05,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 05:19:05,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 05:19:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:05,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:19:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:05,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234768020] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:19:05,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:19:05,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-08-31 05:19:05,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312179621] [2021-08-31 05:19:05,810 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-08-31 05:19:05,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141489237] [2021-08-31 05:19:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,814 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,818 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:05,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 05:19:05,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-31 05:19:05,851 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-08-31 05:19:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:05,906 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-08-31 05:19:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:19:05,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2021-08-31 05:19:05,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2021-08-31 05:19:05,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-31 05:19:05,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-31 05:19:05,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-08-31 05:19:05,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:05,909 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-31 05:19:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-08-31 05:19:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-31 05:19:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 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-08-31 05:19:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-08-31 05:19:05,911 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-31 05:19:05,911 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-08-31 05:19:05,911 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 05:19:05,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-08-31 05:19:05,911 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-08-31 05:19:05,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:05,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:05,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-08-31 05:19:05,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:05,912 INFO L791 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 450#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 458#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 447#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 448#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 469#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 476#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 475#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 474#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 473#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 472#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 471#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 470#L37-3 assume !(main_~i~1 < 5); 463#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 464#L18-3 [2021-08-31 05:19:05,912 INFO L793 eck$LassoCheckResult]: Loop: 464#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 467#L20 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 465#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 464#L18-3 [2021-08-31 05:19:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-08-31 05:19:05,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501367606] [2021-08-31 05:19:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,921 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-08-31 05:19:05,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166850886] [2021-08-31 05:19:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,936 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2021-08-31 05:19:05,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:05,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989028268] [2021-08-31 05:19:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:05,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,960 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:05,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:06,906 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:06,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:06,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:06,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:06,907 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:06,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:06,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:06,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:06,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration5_Lasso [2021-08-31 05:19:06,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:06,907 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:06,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:06,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:06,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:06,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:06,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:06,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:07,320 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:07,320 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:19:07,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,324 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-08-31 05:19:07,325 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-08-31 05:19:07,326 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-08-31 05:19:07,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:07,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:07,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:07,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:07,352 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-08-31 05:19:07,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,354 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-08-31 05:19:07,354 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-08-31 05:19:07,356 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-08-31 05:19:07,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:07,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:07,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:07,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:07,379 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-08-31 05:19:07,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,381 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-08-31 05:19:07,381 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-08-31 05:19:07,382 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-08-31 05:19:07,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:07,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:07,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:07,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:07,408 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-08-31 05:19:07,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,409 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-08-31 05:19:07,409 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-08-31 05:19:07,411 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-08-31 05:19:07,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:07,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:07,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:07,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:07,454 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-08-31 05:19:07,455 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,456 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-08-31 05:19:07,459 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-08-31 05:19:07,460 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-08-31 05:19:07,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:07,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:07,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:07,488 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-08-31 05:19:07,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,490 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-08-31 05:19:07,491 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-08-31 05:19:07,492 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-08-31 05:19:07,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:07,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:07,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:07,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:07,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:07,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:07,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:19:07,579 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-08-31 05:19:07,579 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-08-31 05:19:07,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,584 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-08-31 05:19:07,585 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-08-31 05:19:07,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:19:07,607 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:19:07,607 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:19:07,607 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = 9*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 8*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2021-08-31 05:19:07,626 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-08-31 05:19:07,652 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-08-31 05:19:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:07,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:19:07,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:07,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:07,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:07,728 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-08-31 05:19:07,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:07,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 46 transitions. Complement of second has 7 states. [2021-08-31 05:19:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-31 05:19:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-08-31 05:19:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-31 05:19:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2021-08-31 05:19:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2021-08-31 05:19:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:07,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2021-08-31 05:19:07,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:07,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2021-08-31 05:19:07,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 05:19:07,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-31 05:19:07,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2021-08-31 05:19:07,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:07,752 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-31 05:19:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2021-08-31 05:19:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-08-31 05:19:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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-08-31 05:19:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-08-31 05:19:07,762 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-31 05:19:07,762 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-31 05:19:07,762 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 05:19:07,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-08-31 05:19:07,764 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:07,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:07,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:07,765 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:07,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:07,766 INFO L791 eck$LassoCheckResult]: Stem: 633#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 634#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 642#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 631#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 632#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 654#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 661#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 660#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 659#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 658#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 657#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 656#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 655#L37-3 assume !(main_~i~1 < 5); 647#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 648#L18-3 assume !(sep_~i~0 < 5); 651#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 635#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 636#L18-8 [2021-08-31 05:19:07,766 INFO L793 eck$LassoCheckResult]: Loop: 636#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 646#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 653#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 636#L18-8 [2021-08-31 05:19:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2021-08-31 05:19:07,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931598788] [2021-08-31 05:19:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:07,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-08-31 05:19:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:19:07,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:07,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931598788] [2021-08-31 05:19:07,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931598788] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:07,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 05:19:07,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 05:19:07,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351416796] [2021-08-31 05:19:07,810 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2021-08-31 05:19:07,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818018860] [2021-08-31 05:19:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,820 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:07,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:07,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:07,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 05:19:07,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 05:19:07,857 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:07,899 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-08-31 05:19:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 05:19:07,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-08-31 05:19:07,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:07,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-08-31 05:19:07,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-31 05:19:07,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-31 05:19:07,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-08-31 05:19:07,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:07,901 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-08-31 05:19:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-08-31 05:19:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-08-31 05:19:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 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-08-31 05:19:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-08-31 05:19:07,903 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-31 05:19:07,903 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-31 05:19:07,903 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 05:19:07,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2021-08-31 05:19:07,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:07,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:07,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:07,904 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:07,904 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:07,904 INFO L791 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 710#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 718#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 707#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 708#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 731#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 738#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 737#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 736#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 735#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 734#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 733#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 732#L37-3 assume !(main_~i~1 < 5); 723#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 724#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 727#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 725#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 726#L18-3 assume !(sep_~i~0 < 5); 728#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 711#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 712#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 721#L20-2 [2021-08-31 05:19:07,904 INFO L793 eck$LassoCheckResult]: Loop: 721#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 729#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 730#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 721#L20-2 [2021-08-31 05:19:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2021-08-31 05:19:07,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:07,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395428722] [2021-08-31 05:19:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:19:07,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:07,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395428722] [2021-08-31 05:19:07,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395428722] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:07,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898684792] [2021-08-31 05:19:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:07,928 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:07,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:07,928 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:07,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-31 05:19:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:07,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-31 05:19:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:19:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:19:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-31 05:19:08,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898684792] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:19:08,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:19:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-08-31 05:19:08,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146687805] [2021-08-31 05:19:08,041 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,041 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2021-08-31 05:19:08,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455425768] [2021-08-31 05:19:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,055 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,061 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:08,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 05:19:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-31 05:19:08,097 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-08-31 05:19:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:08,176 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2021-08-31 05:19:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 05:19:08,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2021-08-31 05:19:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:08,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2021-08-31 05:19:08,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-08-31 05:19:08,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-08-31 05:19:08,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2021-08-31 05:19:08,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:08,182 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-08-31 05:19:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2021-08-31 05:19:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2021-08-31 05:19:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2021-08-31 05:19:08,189 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-08-31 05:19:08,189 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-08-31 05:19:08,189 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 05:19:08,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2021-08-31 05:19:08,190 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:08,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:08,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:08,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:08,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:08,192 INFO L791 eck$LassoCheckResult]: Stem: 931#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 932#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 940#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 929#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 930#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 955#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 971#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 969#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 967#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 965#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 963#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 960#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 959#L37-3 assume !(main_~i~1 < 5); 945#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 946#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 951#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 978#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 952#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 953#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 947#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 948#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 977#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 976#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 975#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 973#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 974#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 972#L18-3 assume !(sep_~i~0 < 5); 949#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 933#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 934#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 943#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 950#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 954#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 970#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 968#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 966#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 964#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 962#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 961#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 957#L20-2 [2021-08-31 05:19:08,192 INFO L793 eck$LassoCheckResult]: Loop: 957#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 958#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 956#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 957#L20-2 [2021-08-31 05:19:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 1 times [2021-08-31 05:19:08,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064592959] [2021-08-31 05:19:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-31 05:19:08,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:08,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064592959] [2021-08-31 05:19:08,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064592959] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:08,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641525672] [2021-08-31 05:19:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:08,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:08,273 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:08,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-31 05:19:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:08,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:08,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-31 05:19:08,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 05:19:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-31 05:19:08,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641525672] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 05:19:08,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 05:19:08,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-08-31 05:19:08,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435105862] [2021-08-31 05:19:08,430 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 05:19:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2021-08-31 05:19:08,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582931178] [2021-08-31 05:19:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,433 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,436 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:08,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 05:19:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-31 05:19:08,469 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08-31 05:19:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:08,567 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2021-08-31 05:19:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 05:19:08,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2021-08-31 05:19:08,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:08,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2021-08-31 05:19:08,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-08-31 05:19:08,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-08-31 05:19:08,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2021-08-31 05:19:08,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:08,569 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2021-08-31 05:19:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2021-08-31 05:19:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2021-08-31 05:19:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 states have internal predecessors, (71), 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-08-31 05:19:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2021-08-31 05:19:08,571 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-08-31 05:19:08,571 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-08-31 05:19:08,571 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 05:19:08,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2021-08-31 05:19:08,571 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-08-31 05:19:08,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:08,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:08,572 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:08,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 05:19:08,572 INFO L791 eck$LassoCheckResult]: Stem: 1289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1290#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1298#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1287#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1288#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1313#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1342#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1341#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1340#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1339#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1338#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1337#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1336#L37-3 assume !(main_~i~1 < 5); 1304#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1305#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1308#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1306#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1307#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1309#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1333#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1331#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1329#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1327#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1325#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1323#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1321#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1320#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1315#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1316#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1314#L18-3 assume !(sep_~i~0 < 5); 1310#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1291#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1292#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1311#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1312#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1301#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1302#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1335#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1334#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1332#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1330#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1328#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1326#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1324#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1322#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1318#L20-2 [2021-08-31 05:19:08,572 INFO L793 eck$LassoCheckResult]: Loop: 1318#L20-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1319#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1317#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1318#L20-2 [2021-08-31 05:19:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 2 times [2021-08-31 05:19:08,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444311665] [2021-08-31 05:19:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,659 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,735 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2021-08-31 05:19:08,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204290740] [2021-08-31 05:19:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,741 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:08,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2021-08-31 05:19:08,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:08,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197918731] [2021-08-31 05:19:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-08-31 05:19:08,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 05:19:08,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197918731] [2021-08-31 05:19:08,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197918731] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 05:19:08,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786542610] [2021-08-31 05:19:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:08,791 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 05:19:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:08,792 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 05:19:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-31 05:19:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:08,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 05:19:08,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-08-31 05:19:08,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-31 05:19:08,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786542610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 05:19:08,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-31 05:19:08,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-08-31 05:19:08,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565037687] [2021-08-31 05:19:08,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 05:19:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 05:19:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-08-31 05:19:08,964 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-08-31 05:19:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 05:19:09,108 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-08-31 05:19:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-31 05:19:09,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2021-08-31 05:19:09,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 05:19:09,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2021-08-31 05:19:09,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-08-31 05:19:09,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-08-31 05:19:09,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2021-08-31 05:19:09,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:09,111 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-31 05:19:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2021-08-31 05:19:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-31 05:19:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 05:19:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-08-31 05:19:09,112 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-31 05:19:09,113 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-08-31 05:19:09,113 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 05:19:09,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2021-08-31 05:19:09,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 05:19:09,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 05:19:09,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 05:19:09,114 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 05:19:09,114 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 05:19:09,114 INFO L791 eck$LassoCheckResult]: Stem: 1569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1570#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_~i~1, main_#t~ret9, main_#t~mem10, main_#t~mem11, main_#t~ret12, main_#t~mem13, main_#t~mem15, main_#t~post14, main_~i~2, main_#t~ret16, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1576#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1567#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1568#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1587#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1601#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1599#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1597#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1595#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1593#L37-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet8, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet8; 1590#L37-2 main_#t~post7 := main_~i~1;main_~i~1 := 1 + main_#t~post7;havoc main_#t~post7; 1589#L37-3 assume !(main_~i~1 < 5); 1579#L37-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1580#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1584#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1581#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1582#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1618#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1617#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1616#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1615#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1614#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1613#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1612#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1611#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1610#L18-3 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1609#L20 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1608#L18-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1606#L18-3 assume !(sep_~i~0 < 5); 1585#L18-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1571#L25 main_#t~ret9 := sep_#res;main_~ret~1 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem11;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1572#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1577#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1583#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1586#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1607#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1605#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1604#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1603#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1602#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1600#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1598#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1596#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1594#L18-8 assume !!(sep_~i~0 < 5);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1592#L20-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1591#L18-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1588#L18-8 assume !(sep_~i~0 < 5); 1578#L18-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1573#L25-1 main_#t~ret12 := sep_#res;main_~ret2~0 := main_#t~ret12;havoc main_#t~ret12;call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem13;havoc main_#t~mem13;main_~i~2 := 0; 1574#L46-3 [2021-08-31 05:19:09,115 INFO L793 eck$LassoCheckResult]: Loop: 1574#L46-3 assume !!(main_~i~2 < 4);call main_#t~mem15 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem15, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem15; 1575#L46-2 main_#t~post14 := main_~i~2;main_~i~2 := 1 + main_#t~post14;havoc main_#t~post14; 1574#L46-3 [2021-08-31 05:19:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2021-08-31 05:19:09,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:09,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081300949] [2021-08-31 05:19:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:09,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2021-08-31 05:19:09,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:09,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508101696] [2021-08-31 05:19:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:09,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,247 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2021-08-31 05:19:09,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 05:19:09,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517916282] [2021-08-31 05:19:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 05:19:09,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 05:19:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,289 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 05:19:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 05:19:09,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 05:19:12,732 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 05:19:12,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 05:19:12,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 05:19:12,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 05:19:12,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 05:19:12,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:12,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 05:19:12,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 05:19:12,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration10_Lasso [2021-08-31 05:19:12,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 05:19:12,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 05:19:12,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:12,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 05:19:13,506 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 05:19:13,506 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 05:19:13,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,509 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-08-31 05:19:13,510 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-08-31 05:19:13,556 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-08-31 05:19:13,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,596 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-08-31 05:19:13,596 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,597 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-08-31 05:19:13,598 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-08-31 05:19:13,599 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-08-31 05:19:13,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,621 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-08-31 05:19:13,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,623 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-08-31 05:19:13,627 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-08-31 05:19:13,627 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-08-31 05:19:13,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:13,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:13,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,661 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-08-31 05:19:13,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,662 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:13,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 05:19:13,664 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-08-31 05:19:13,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,686 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:13,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-31 05:19:13,688 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-08-31 05:19:13,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,711 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,712 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-31 05:19:13,715 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-08-31 05:19:13,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,753 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 05:19:13,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-31 05:19:13,755 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-08-31 05:19:13,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,778 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,779 INFO L229 MonitoredProcess]: Starting monitored process 28 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-08-31 05:19:13,785 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-08-31 05:19:13,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-31 05:19:13,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-08-31 05:19:13,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,837 INFO L229 MonitoredProcess]: Starting monitored process 29 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-08-31 05:19:13,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 05:19:13,839 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-08-31 05:19:13,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:13,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:13,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:13,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,862 INFO L229 MonitoredProcess]: Starting monitored process 30 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-08-31 05:19:13,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 05:19:13,864 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-08-31 05:19:13,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:13,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:13,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,906 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,906 INFO L229 MonitoredProcess]: Starting monitored process 31 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-08-31 05:19:13,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-31 05:19:13,908 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-08-31 05:19:13,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:13,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:13,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,932 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,933 INFO L229 MonitoredProcess]: Starting monitored process 32 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-08-31 05:19:13,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-31 05:19:13,934 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-08-31 05:19:13,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:13,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:13,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:13,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:13,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:13,971 INFO L229 MonitoredProcess]: Starting monitored process 33 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-08-31 05:19:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-31 05:19:13,973 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-08-31 05:19:13,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:13,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:13,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:13,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:13,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:13,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:13,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:14,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-31 05:19:14,011 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:14,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:14,012 INFO L229 MonitoredProcess]: Starting monitored process 34 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-08-31 05:19:14,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-31 05:19:14,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-08-31 05:19:14,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:14,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:14,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:14,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:14,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:14,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:14,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:14,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:14,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,052 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:14,053 INFO L229 MonitoredProcess]: Starting monitored process 35 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-08-31 05:19:14,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-31 05:19:14,055 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-08-31 05:19:14,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:14,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:14,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:14,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:14,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:14,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:14,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:14,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,094 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:14,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:14,094 INFO L229 MonitoredProcess]: Starting monitored process 36 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-08-31 05:19:14,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-31 05:19:14,096 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-08-31 05:19:14,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:14,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 05:19:14,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:14,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:14,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:14,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 05:19:14,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 05:19:14,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 05:19:14,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:14,129 INFO L229 MonitoredProcess]: Starting monitored process 37 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-08-31 05:19:14,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-31 05:19:14,130 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-08-31 05:19:14,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 05:19:14,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 05:19:14,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 05:19:14,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 05:19:14,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 05:19:14,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 05:19:14,146 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 05:19:14,159 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-08-31 05:19:14,159 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-08-31 05:19:14,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 05:19:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 05:19:14,160 INFO L229 MonitoredProcess]: Starting monitored process 38 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-08-31 05:19:14,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-31 05:19:14,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 05:19:14,168 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-31 05:19:14,168 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 05:19:14,168 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2021-08-31 05:19:14,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,257 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2021-08-31 05:19:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 05:19:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:14,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 05:19:14,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 05:19:14,390 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 05:19:14,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 05:19:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 05:19:14,407 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-08-31 05:19:14,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-31 05:19:14,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Result 54 states and 66 transitions. Complement of second has 4 states. [2021-08-31 05:19:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 05:19:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-08-31 05:19:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-08-31 05:19:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2021-08-31 05:19:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2021-08-31 05:19:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2021-08-31 05:19:14,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 05:19:14,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2021-08-31 05:19:14,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 05:19:14,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2021-08-31 05:19:14,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 05:19:14,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 05:19:14,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 05:19:14,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 05:19:14,431 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 05:19:14,431 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 05:19:14,431 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 05:19:14,431 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 05:19:14,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 05:19:14,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 05:19:14,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 05:19:14,433 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 05:19:14,449 INFO L158 Benchmark]: Toolchain (without parser) took 11402.79ms. Allocated memory was 50.3MB in the beginning and 130.0MB in the end (delta: 79.7MB). Free memory was 27.3MB in the beginning and 35.8MB in the end (delta: -8.5MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2021-08-31 05:19:14,449 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.0MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:19:14,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.92ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.1MB in the beginning and 44.0MB in the end (delta: -16.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-08-31 05:19:14,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.95ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 05:19:14,450 INFO L158 Benchmark]: Boogie Preprocessor took 30.33ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 05:19:14,450 INFO L158 Benchmark]: RCFGBuilder took 218.85ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 30.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-31 05:19:14,450 INFO L158 Benchmark]: BuchiAutomizer took 10900.89ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 30.1MB in the beginning and 35.8MB in the end (delta: -5.6MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2021-08-31 05:19:14,451 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.0MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.92ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.1MB in the beginning and 44.0MB in the end (delta: -16.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.95ms. Allocated memory is still 60.8MB. Free memory was 43.8MB in the beginning and 42.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.33ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.85ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 30.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10900.89ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 30.1MB in the beginning and 35.8MB in the end (delta: -5.6MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 7 * unknown-#length-unknown[x] and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 05:19:14,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:14,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-08-31 05:19:15,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-31 05:19:15,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:15,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-31 05:19:15,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...