./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/loops/invert_string-3.c -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 ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:38:36,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:38:36,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:38:36,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:38:36,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:38:36,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:38:36,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:38:36,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:38:36,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:38:36,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:38:36,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:38:36,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:38:36,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:38:36,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:38:36,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:38:36,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:38:36,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:38:36,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:38:36,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:38:36,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:38:36,371 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:38:36,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:38:36,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:38:36,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:38:36,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:38:36,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:38:36,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:38:36,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:38:36,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:38:36,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:38:36,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:38:36,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:38:36,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:38:36,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:38:36,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:38:36,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:38:36,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:38:36,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:38:36,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:38:36,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:38:36,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:38:36,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:38:36,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:38:36,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:38:36,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:38:36,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:38:36,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:38:36,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:38:36,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:38:36,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:38:36,403 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:38:36,403 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:38:36,403 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:38:36,403 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:38:36,404 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:38:36,404 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:38:36,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:38:36,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:38:36,404 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:38:36,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:38:36,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:38:36,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:38:36,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:38:36,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:38:36,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:38:36,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:38:36,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:38:36,406 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:38:36,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:38:36,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:38:36,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:38:36,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:38:36,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:38:36,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:38:36,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:38:36,412 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 -> ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 [2022-07-14 15:38:36,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:38:36,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:38:36,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:38:36,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:38:36,616 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:38:36,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2022-07-14 15:38:36,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1f93e6b/cd7ba82eccbc43c6817abb2ae8e0cd62/FLAGce803c4f1 [2022-07-14 15:38:37,045 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:38:37,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2022-07-14 15:38:37,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1f93e6b/cd7ba82eccbc43c6817abb2ae8e0cd62/FLAGce803c4f1 [2022-07-14 15:38:37,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1f93e6b/cd7ba82eccbc43c6817abb2ae8e0cd62 [2022-07-14 15:38:37,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:38:37,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:38:37,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:37,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:38:37,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:38:37,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4175a6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37, skipping insertion in model container [2022-07-14 15:38:37,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:38:37,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:38:37,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-07-14 15:38:37,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:37,257 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:38:37,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c[327,340] [2022-07-14 15:38:37,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:37,289 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:38:37,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37 WrapperNode [2022-07-14 15:38:37,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:37,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:37,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:38:37,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:38:37,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,326 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-07-14 15:38:37,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:37,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:38:37,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:38:37,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:38:37,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:38:37,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:38:37,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:38:37,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:38:37,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (1/1) ... [2022-07-14 15:38:37,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:37,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:37,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:37,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:38:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:38:37,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:38:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:38:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:38:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:38:37,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:38:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:38:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:38:37,486 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:38:37,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:38:37,612 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:38:37,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:38:37,616 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 15:38:37,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:37 BoogieIcfgContainer [2022-07-14 15:38:37,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:38:37,618 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:38:37,618 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:38:37,630 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:38:37,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:37,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:38:37" (1/3) ... [2022-07-14 15:38:37,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42aa7e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:37, skipping insertion in model container [2022-07-14 15:38:37,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:37,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:37" (2/3) ... [2022-07-14 15:38:37,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42aa7e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:37, skipping insertion in model container [2022-07-14 15:38:37,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:37,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:37" (3/3) ... [2022-07-14 15:38:37,633 INFO L354 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2022-07-14 15:38:37,697 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:38:37,711 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:38:37,711 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:38:37,711 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:38:37,712 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:38:37,712 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:38:37,712 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:38:37,712 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:38:37,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:37,734 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-14 15:38:37,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:37,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:37,738 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:38:37,739 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:37,739 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:38:37,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:37,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-14 15:38:37,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:37,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:37,741 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:38:37,741 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:37,747 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 14#L18-3true [2022-07-14 15:38:37,763 INFO L754 eck$LassoCheckResult]: Loop: 14#L18-3true assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 9#L18-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 14#L18-3true [2022-07-14 15:38:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:38:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:37,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627460278] [2022-07-14 15:38:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 15:38:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53591593] [2022-07-14 15:38:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 15:38:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916759692] [2022-07-14 15:38:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:37,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:38,325 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:38:38,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:38:38,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:38:38,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:38:38,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:38:38,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:38,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:38:38,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:38:38,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2022-07-14 15:38:38,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:38:38,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:38:38,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:38,993 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:38:38,996 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:38:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:38:39,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 [2022-07-14 15:38:39,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,062 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 [2022-07-14 15:38:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:38:39,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:38:39,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:38:39,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:38:39,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:38:39,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:38:39,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 15:38:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:38:39,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-14 15:38:39,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:38:39,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:38:39,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:38:39,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-14 15:38:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 15:38:39,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 15:38:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:38:39,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:39,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:39,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:39,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,684 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 15:38:39,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,746 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 15:38:39,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 [2022-07-14 15:38:39,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:39,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,783 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 15:38:39,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:39,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:39,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:39,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:39,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:39,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:39,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:39,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:38:39,834 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-14 15:38:39,834 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-14 15:38:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:39,851 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:39,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:38:39,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:38:39,891 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:38:39,891 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:38:39,892 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#str1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~#str1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1 Supporting invariants [] [2022-07-14 15:38:39,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:39,959 INFO L293 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2022-07-14 15:38:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:40,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:38:40,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:40,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:38:40,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:40,073 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:38:40,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) [2022-07-14 15:38:40,121 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 33 states and 47 transitions. Complement of second has 8 states. [2022-07-14 15:38:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:38:40,126 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) [2022-07-14 15:38:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-07-14 15:38:40,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 15:38:40,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:40,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 15:38:40,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:40,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 15:38:40,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:40,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2022-07-14 15:38:40,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-14 15:38:40,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2022-07-14 15:38:40,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:38:40,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-14 15:38:40,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-07-14 15:38:40,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:40,147 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:38:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-07-14 15:38:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 15:38:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-14 15:38:40,168 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:38:40,168 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-14 15:38:40,168 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:38:40,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-14 15:38:40,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-07-14 15:38:40,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:40,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:40,169 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:38:40,169 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:40,170 INFO L752 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 134#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 143#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 142#L26-3 [2022-07-14 15:38:40,170 INFO L754 eck$LassoCheckResult]: Loop: 142#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 141#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 142#L26-3 [2022-07-14 15:38:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-14 15:38:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981563958] [2022-07-14 15:38:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981563958] [2022-07-14 15:38:40,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981563958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:40,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:40,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:38:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821549567] [2022-07-14 15:38:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:40,353 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2022-07-14 15:38:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:40,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782314386] [2022-07-14 15:38:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:40,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:40,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:40,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:38:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:38:40,417 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 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) [2022-07-14 15:38:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:40,434 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-07-14 15:38:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:38:40,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2022-07-14 15:38:40,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:40,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2022-07-14 15:38:40,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:38:40,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:38:40,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-14 15:38:40,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:40,437 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-14 15:38:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-14 15:38:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-14 15:38:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-14 15:38:40,438 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-14 15:38:40,438 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-14 15:38:40,438 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:38:40,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-07-14 15:38:40,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:40,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:40,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:40,439 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:38:40,439 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:40,440 INFO L752 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 176#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 171#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 172#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 177#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 175#L26-3 [2022-07-14 15:38:40,440 INFO L754 eck$LassoCheckResult]: Loop: 175#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 174#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 175#L26-3 [2022-07-14 15:38:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-14 15:38:40,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:40,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724945406] [2022-07-14 15:38:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:40,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724945406] [2022-07-14 15:38:40,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724945406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:38:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252231434] [2022-07-14 15:38:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:40,512 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) [2022-07-14 15:38:40,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 15:38:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:40,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 15:38:40,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:40,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:38:40,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 15:38:40,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 15:38:40,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:40,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:38:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:40,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252231434] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:38:40,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:38:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-14 15:38:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074972454] [2022-07-14 15:38:40,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:38:40,828 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2022-07-14 15:38:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:40,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112319410] [2022-07-14 15:38:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:40,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:40,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 15:38:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 15:38:40,890 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:41,004 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-07-14 15:38:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:38:41,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2022-07-14 15:38:41,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:41,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2022-07-14 15:38:41,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:38:41,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:38:41,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2022-07-14 15:38:41,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:41,006 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-14 15:38:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2022-07-14 15:38:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-14 15:38:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-14 15:38:41,007 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-14 15:38:41,007 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-14 15:38:41,007 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:38:41,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-07-14 15:38:41,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:41,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:41,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:41,008 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-14 15:38:41,008 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:41,008 INFO L752 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 253#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 247#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 248#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 254#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 260#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 259#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 258#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 257#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 256#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 255#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 252#L26-3 [2022-07-14 15:38:41,008 INFO L754 eck$LassoCheckResult]: Loop: 252#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 251#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 252#L26-3 [2022-07-14 15:38:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-14 15:38:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:41,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602186045] [2022-07-14 15:38:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602186045] [2022-07-14 15:38:41,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602186045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:38:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506051658] [2022-07-14 15:38:41,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:41,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:41,351 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) [2022-07-14 15:38:41,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 15:38:41,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:38:41,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:38:41,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 15:38:41,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:41,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 15:38:41,447 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 15:38:41,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 15:38:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:41,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:38:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:41,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506051658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:38:41,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:38:41,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-07-14 15:38:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855021747] [2022-07-14 15:38:41,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:38:41,975 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2022-07-14 15:38:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:41,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771058775] [2022-07-14 15:38:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:41,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:41,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:42,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 15:38:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-07-14 15:38:42,034 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:42,214 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-14 15:38:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:38:42,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2022-07-14 15:38:42,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:42,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2022-07-14 15:38:42,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-14 15:38:42,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-14 15:38:42,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2022-07-14 15:38:42,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:42,216 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-14 15:38:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2022-07-14 15:38:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-14 15:38:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-14 15:38:42,217 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-14 15:38:42,217 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-14 15:38:42,218 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:38:42,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2022-07-14 15:38:42,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:42,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:42,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:42,218 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-07-14 15:38:42,218 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:42,218 INFO L752 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 382#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 383#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 384#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 376#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 377#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 391#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 390#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 389#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 388#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 387#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 386#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 385#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 381#L26-3 [2022-07-14 15:38:42,219 INFO L754 eck$LassoCheckResult]: Loop: 381#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 380#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 381#L26-3 [2022-07-14 15:38:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-07-14 15:38:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:42,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104149624] [2022-07-14 15:38:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2022-07-14 15:38:42,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:42,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442274060] [2022-07-14 15:38:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2022-07-14 15:38:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926255955] [2022-07-14 15:38:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:42,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:44,523 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:38:44,523 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:38:44,523 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:38:44,523 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:38:44,523 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:38:44,523 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:44,523 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:38:44,523 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:38:44,523 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration5_Lasso [2022-07-14 15:38:44,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:38:44,523 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:38:44,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:44,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:44,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:44,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:44,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:44,873 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 15:38:44,875 INFO L158 Benchmark]: Toolchain (without parser) took 7804.31ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 70.4MB in the beginning and 69.7MB in the end (delta: 768.4kB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,875 INFO L158 Benchmark]: CDTParser took 12.75ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:38:44,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.73ms. Allocated memory is still 100.7MB. Free memory was 70.2MB in the beginning and 75.2MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,876 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 72.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,876 INFO L158 Benchmark]: RCFGBuilder took 253.25ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 61.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,877 INFO L158 Benchmark]: BuchiAutomizer took 7256.37ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 61.5MB in the beginning and 69.7MB in the end (delta: -8.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-07-14 15:38:44,878 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 12.75ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 55.5MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.73ms. Allocated memory is still 100.7MB. Free memory was 70.2MB in the beginning and 75.2MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 100.7MB. Free memory was 73.5MB in the beginning and 72.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.25ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 61.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7256.37ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 61.5MB in the beginning and 69.7MB in the end (delta: -8.1MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 15:38:44,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:45,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:45,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null