./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/termination-memory-alloca/twisted-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:40:27,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:40:27,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:40:27,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:40:27,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:40:27,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:40:27,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:40:27,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:40:27,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:40:27,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:40:27,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:40:27,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:40:27,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:40:27,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:40:27,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:40:27,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:40:27,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:40:27,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:40:27,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:40:27,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:40:27,294 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:40:27,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:40:27,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:40:27,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:40:27,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:40:27,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:40:27,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:40:27,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:40:27,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:40:27,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:40:27,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:40:27,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:40:27,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:40:27,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:40:27,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:40:27,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:40:27,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:40:27,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:40:27,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:40:27,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:40:27,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:40:27,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:40:27,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:40:27,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:40:27,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:40:27,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:40:27,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:40:27,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:40:27,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:40:27,343 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:40:27,344 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:40:27,344 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:40:27,344 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:40:27,344 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:40:27,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:40:27,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:40:27,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:40:27,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:40:27,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:40:27,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:40:27,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:40:27,348 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:40:27,349 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 [2022-07-22 01:40:27,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:40:27,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:40:27,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:40:27,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:40:27,630 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:40:27,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-07-22 01:40:27,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96af6ab27/97eb8ecefe1646b087f8fefea246cf02/FLAG484aaf228 [2022-07-22 01:40:28,001 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:40:28,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-07-22 01:40:28,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96af6ab27/97eb8ecefe1646b087f8fefea246cf02/FLAG484aaf228 [2022-07-22 01:40:28,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96af6ab27/97eb8ecefe1646b087f8fefea246cf02 [2022-07-22 01:40:28,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:40:28,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:40:28,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:40:28,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:40:28,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:40:28,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0e2795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28, skipping insertion in model container [2022-07-22 01:40:28,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:40:28,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:40:28,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:40:28,623 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:40:28,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:40:28,742 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:40:28,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28 WrapperNode [2022-07-22 01:40:28,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:40:28,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:40:28,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:40:28,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:40:28,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,819 INFO L137 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-07-22 01:40:28,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:40:28,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:40:28,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:40:28,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:40:28,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:40:28,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:40:28,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:40:28,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:40:28,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (1/1) ... [2022-07-22 01:40:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:28,933 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-22 01:40:28,942 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-22 01:40:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:40:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:40:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:40:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:40:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:40:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:40:29,038 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:40:29,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:40:29,205 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:40:29,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:40:29,212 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:40:29,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:40:29 BoogieIcfgContainer [2022-07-22 01:40:29,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:40:29,231 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:40:29,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:40:29,233 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:40:29,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:29,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:40:28" (1/3) ... [2022-07-22 01:40:29,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccbb87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:40:29, skipping insertion in model container [2022-07-22 01:40:29,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:29,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:28" (2/3) ... [2022-07-22 01:40:29,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccbb87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:40:29, skipping insertion in model container [2022-07-22 01:40:29,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:29,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:40:29" (3/3) ... [2022-07-22 01:40:29,237 INFO L354 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2022-07-22 01:40:29,309 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:40:29,309 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:40:29,309 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:40:29,309 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:40:29,309 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:40:29,310 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:40:29,310 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:40:29,310 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:40:29,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:29,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 01:40:29,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:29,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:29,338 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:40:29,338 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:40:29,338 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:40:29,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:29,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 01:40:29,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:29,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:29,342 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:40:29,342 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:40:29,348 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 2#L569true [2022-07-22 01:40:29,349 INFO L754 eck$LassoCheckResult]: Loop: 2#L569true assume !true; 12#L564true goto; 11#L567true call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 7#L564-1true assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 9#L566true assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 2#L569true [2022-07-22 01:40:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:40:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:29,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498575077] [2022-07-22 01:40:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2022-07-22 01:40:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:29,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630270636] [2022-07-22 01:40:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:29,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:29,538 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-22 01:40:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:29,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630270636] [2022-07-22 01:40:29,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630270636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:40:29,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:40:29,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 01:40:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160040865] [2022-07-22 01:40:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:40:29,543 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:40:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 01:40:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 01:40:29,576 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 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-22 01:40:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:29,580 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-22 01:40:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 01:40:29,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-22 01:40:29,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 01:40:29,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2022-07-22 01:40:29,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-22 01:40:29,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-22 01:40:29,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-07-22 01:40:29,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:40:29,589 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-22 01:40:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-07-22 01:40:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 01:40:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-22 01:40:29,607 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-22 01:40:29,607 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-22 01:40:29,607 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:40:29,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-07-22 01:40:29,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-22 01:40:29,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:29,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:29,608 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:40:29,608 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:29,608 INFO L752 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 38#L569 [2022-07-22 01:40:29,609 INFO L754 eck$LassoCheckResult]: Loop: 38#L569 goto; 39#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 44#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 43#L564 goto; 45#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 46#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 47#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 38#L569 [2022-07-22 01:40:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:40:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:29,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143111843] [2022-07-22 01:40:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2022-07-22 01:40:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866866259] [2022-07-22 01:40:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2022-07-22 01:40:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959278047] [2022-07-22 01:40:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:29,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:31,303 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:31,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:31,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:31,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:31,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:31,305 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,305 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:31,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:31,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2022-07-22 01:40:31,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:31,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:31,327 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-22 01:40:31,333 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-22 01:40:31,336 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-22 01:40:31,338 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-22 01:40:31,341 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-22 01:40:31,344 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-22 01:40:31,346 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-22 01:40:31,355 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-22 01:40:32,018 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-22 01:40:32,021 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-22 01:40:32,022 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-22 01:40:32,024 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-22 01:40:32,026 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-22 01:40:32,027 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-22 01:40:32,028 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-22 01:40:32,030 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-22 01:40:32,031 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-22 01:40:32,037 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-22 01:40:32,038 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-22 01:40:32,040 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-22 01:40:32,041 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-22 01:40:32,042 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-22 01:40:32,043 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-22 01:40:32,431 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:32,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,446 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-22 01:40:32,457 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-22 01:40:32,457 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-22 01:40:32,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:32,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:32,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:32,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:32,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,492 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-22 01:40:32,495 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-22 01:40:32,498 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-22 01:40:32,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:32,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:32,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:32,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,567 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-22 01:40:32,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,569 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-22 01:40:32,570 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-22 01:40:32,572 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-22 01:40:32,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,622 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-22 01:40:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,623 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-22 01:40:32,625 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-22 01:40:32,626 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-22 01:40:32,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,662 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-22 01:40:32,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,664 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-22 01:40:32,667 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-22 01:40:32,669 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-22 01:40:32,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,705 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-22 01:40:32,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,721 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-22 01:40:32,723 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-22 01:40:32,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:32,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:32,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:32,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:32,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,753 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-22 01:40:32,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,754 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-22 01:40:32,756 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-22 01:40:32,757 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-22 01:40:32,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:32,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:32,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:32,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,793 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-22 01:40:32,794 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-22 01:40:32,796 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-22 01:40:32,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:32,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,870 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-22 01:40:32,884 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-22 01:40:32,884 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-22 01:40:32,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,936 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-22 01:40:32,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,938 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-22 01:40:32,939 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-22 01:40:32,940 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-22 01:40:32,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:32,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:32,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:32,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:32,985 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-22 01:40:32,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:32,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:32,987 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-22 01:40:32,989 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-22 01:40:32,990 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-22 01:40:32,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:32,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:32,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:32,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,063 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-22 01:40:33,064 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-22 01:40:33,065 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-22 01:40:33,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:33,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,120 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-22 01:40:33,122 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-22 01:40:33,123 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-22 01:40:33,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,165 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-22 01:40:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,166 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-22 01:40:33,187 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-22 01:40:33,188 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-22 01:40:33,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,251 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-22 01:40:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,259 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-22 01:40:33,262 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-22 01:40:33,263 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-22 01:40:33,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,311 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-22 01:40:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,313 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-22 01:40:33,314 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-22 01:40:33,316 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-22 01:40:33,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:33,373 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-22 01:40:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,388 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-22 01:40:33,390 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-22 01:40:33,392 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-22 01:40:33,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:33,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:33,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:33,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:33,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:33,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:33,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:33,443 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 01:40:33,443 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-22 01:40:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:33,473 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:33,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:40:33,532 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:33,532 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:33,533 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1 + 1 Supporting invariants [] [2022-07-22 01:40:33,565 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-22 01:40:33,679 INFO L293 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-07-22 01:40:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:33,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:40:33,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:33,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 01:40:33,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:33,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 23 [2022-07-22 01:40:33,832 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-22 01:40:33,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:40:33,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:33,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:33,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 27 transitions. Complement of second has 6 states. [2022-07-22 01:40:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-07-22 01:40:33,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2022-07-22 01:40:33,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:33,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2022-07-22 01:40:33,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:33,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2022-07-22 01:40:33,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:33,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-22 01:40:33,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:33,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2022-07-22 01:40:33,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-22 01:40:33,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-22 01:40:33,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-07-22 01:40:33,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:33,907 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-07-22 01:40:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-07-22 01:40:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-22 01:40:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-07-22 01:40:33,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-22 01:40:33,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-22 01:40:33,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:40:33,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-07-22 01:40:33,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:33,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:33,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:33,912 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:40:33,912 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:33,912 INFO L752 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 297#L569 goto; 284#L560 [2022-07-22 01:40:33,912 INFO L754 eck$LassoCheckResult]: Loop: 284#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 292#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 289#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 284#L560 [2022-07-22 01:40:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2022-07-22 01:40:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:33,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857994687] [2022-07-22 01:40:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:33,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:33,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-07-22 01:40:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:33,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396921821] [2022-07-22 01:40:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:33,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:34,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-07-22 01:40:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:34,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18776950] [2022-07-22 01:40:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:34,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:34,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:35,189 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:35,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:35,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:35,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:35,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:35,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:35,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:35,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:35,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2022-07-22 01:40:35,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:35,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:35,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:35,197 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-22 01:40:35,199 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-22 01:40:35,201 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-22 01:40:35,202 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-22 01:40:35,203 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-22 01:40:35,204 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-22 01:40:35,710 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-22 01:40:35,712 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-22 01:40:35,714 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-22 01:40:35,715 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-22 01:40:35,717 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-22 01:40:35,719 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-22 01:40:35,721 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-22 01:40:35,722 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-22 01:40:35,724 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-22 01:40:35,725 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-22 01:40:35,727 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-22 01:40:35,728 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-22 01:40:35,730 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-22 01:40:35,733 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-22 01:40:36,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:36,104 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,116 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:40:36,118 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-22 01:40:36,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,145 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:40:36,147 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-22 01:40:36,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,174 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:40:36,178 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-22 01:40:36,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 01:40:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,219 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:40:36,221 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-22 01:40:36,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,258 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:40:36,260 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-22 01:40:36,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,287 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:40:36,295 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-22 01:40:36,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 01:40:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,320 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:40:36,325 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-22 01:40:36,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,366 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:40:36,369 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-22 01:40:36,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,458 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:40:36,462 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-22 01:40:36,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,505 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 01:40:36,508 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-22 01:40:36,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,546 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 01:40:36,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:36,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,598 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 01:40:36,600 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-22 01:40:36,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 01:40:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,642 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 01:40:36,644 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-22 01:40:36,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,714 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 01:40:36,716 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-22 01:40:36,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,801 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 01:40:36,803 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-22 01:40:36,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:36,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:36,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:36,849 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 01:40:36,849 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 01:40:36,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,851 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:36,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 01:40:36,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:36,892 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 01:40:36,892 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:36,892 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2, ULTIMATE.start_f_~k#1) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2 + 1*ULTIMATE.start_f_~k#1 Supporting invariants [1*ULTIMATE.start_f_~k#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_2 >= 0] [2022-07-22 01:40:36,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,069 INFO L293 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2022-07-22 01:40:37,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:37,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 01:40:37,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:37,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 20 treesize of output 20 [2022-07-22 01:40:37,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:37,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2022-07-22 01:40:37,177 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 01:40:37,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2022-07-22 01:40:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:37,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:40:37,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:37,250 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-22 01:40:37,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 40 [2022-07-22 01:40:37,282 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-22 01:40:37,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-22 01:40:37,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:37,324 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 43 transitions. Complement of second has 8 states. [2022-07-22 01:40:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-07-22 01:40:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-22 01:40:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-22 01:40:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:37,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-22 01:40:37,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:37,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2022-07-22 01:40:37,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:37,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2022-07-22 01:40:37,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:40:37,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-22 01:40:37,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-07-22 01:40:37,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:37,327 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-22 01:40:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-07-22 01:40:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-07-22 01:40:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-07-22 01:40:37,329 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-22 01:40:37,329 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-22 01:40:37,329 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:40:37,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-07-22 01:40:37,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:37,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:37,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:37,331 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:37,331 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:37,331 INFO L752 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 531#L569 goto; 532#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 548#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 540#L564 goto; 545#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 546#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 547#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 549#L569 goto; 538#L560 [2022-07-22 01:40:37,331 INFO L754 eck$LassoCheckResult]: Loop: 538#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 543#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 537#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 538#L560 [2022-07-22 01:40:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2022-07-22 01:40:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:37,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685712966] [2022-07-22 01:40:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:37,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:37,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2022-07-22 01:40:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:37,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594854784] [2022-07-22 01:40:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:37,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:37,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2022-07-22 01:40:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136721138] [2022-07-22 01:40:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136721138] [2022-07-22 01:40:37,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136721138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:40:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363046142] [2022-07-22 01:40:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:40:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,497 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-22 01:40:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:37,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 01:40:37,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:37,600 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 18 treesize of output 16 [2022-07-22 01:40:37,681 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 01:40:37,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-07-22 01:40:37,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:40:37,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-22 01:40:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:37,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:40:37,778 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-22 01:40:37,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2022-07-22 01:40:37,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:40:37,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-07-22 01:40:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:37,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363046142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:40:37,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:40:37,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-22 01:40:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753234261] [2022-07-22 01:40:37,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:40:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 01:40:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2022-07-22 01:40:37,880 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:37,969 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-22 01:40:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:40:37,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2022-07-22 01:40:37,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:37,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 24 transitions. [2022-07-22 01:40:37,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:40:37,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-22 01:40:37,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-07-22 01:40:37,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:37,973 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-22 01:40:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-07-22 01:40:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-07-22 01:40:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-22 01:40:37,977 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-22 01:40:37,977 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-22 01:40:37,977 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:40:37,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-22 01:40:37,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:37,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:37,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:37,978 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:37,978 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:37,978 INFO L752 eck$LassoCheckResult]: Stem: 694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 691#L569 goto; 692#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 701#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 698#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 699#L564 goto; 702#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 703#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 704#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 705#L569 goto; 697#L560 [2022-07-22 01:40:37,978 INFO L754 eck$LassoCheckResult]: Loop: 697#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 700#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 696#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 697#L560 [2022-07-22 01:40:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2022-07-22 01:40:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:37,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641569228] [2022-07-22 01:40:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:38,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641569228] [2022-07-22 01:40:38,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641569228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:40:38,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:40:38,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:40:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726925207] [2022-07-22 01:40:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:40:38,102 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:40:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2022-07-22 01:40:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:38,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837919107] [2022-07-22 01:40:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:40:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:40:38,203 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:38,239 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-22 01:40:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:40:38,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-07-22 01:40:38,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:38,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 23 transitions. [2022-07-22 01:40:38,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:40:38,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-22 01:40:38,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-07-22 01:40:38,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:38,240 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 01:40:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-07-22 01:40:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-22 01:40:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 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-22 01:40:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-22 01:40:38,242 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-22 01:40:38,242 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-22 01:40:38,242 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:40:38,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-07-22 01:40:38,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:38,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:38,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:38,242 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:38,242 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:38,243 INFO L752 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 740#L569 goto; 741#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 755#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 748#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 743#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 750#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 757#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 754#L564 goto; 751#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 752#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 753#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 756#L569 goto; 747#L560 [2022-07-22 01:40:38,243 INFO L754 eck$LassoCheckResult]: Loop: 747#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 749#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 746#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 747#L560 [2022-07-22 01:40:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2022-07-22 01:40:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:38,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962844373] [2022-07-22 01:40:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2022-07-22 01:40:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:38,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083299949] [2022-07-22 01:40:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2022-07-22 01:40:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:38,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420617858] [2022-07-22 01:40:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:38,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:40,186 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:40,186 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:40,186 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:40,186 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:40,186 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:40,186 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:40,186 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:40,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:40,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2022-07-22 01:40:40,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:40,186 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:40,188 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-22 01:40:40,190 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-22 01:40:40,191 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-22 01:40:40,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:40,804 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-22 01:40:40,805 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-22 01:40:40,807 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-22 01:40:40,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:40,810 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-22 01:40:40,812 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-22 01:40:40,813 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-22 01:40:40,815 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-22 01:40:40,816 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-22 01:40:40,817 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-22 01:40:40,819 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-22 01:40:40,820 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-22 01:40:40,821 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-22 01:40:40,823 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-22 01:40:40,825 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-22 01:40:40,828 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-22 01:40:40,830 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-22 01:40:41,177 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:41,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:41,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,179 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 01:40:41,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-22 01:40:41,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:41,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:41,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:41,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:41,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,244 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:41,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 01:40:41,246 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-22 01:40:41,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,288 INFO L229 MonitoredProcess]: Starting monitored process 39 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-22 01:40:41,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 01:40:41,291 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-22 01:40:41,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:41,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,332 INFO L229 MonitoredProcess]: Starting monitored process 40 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-22 01:40:41,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 01:40:41,335 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-22 01:40:41,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,382 INFO L229 MonitoredProcess]: Starting monitored process 41 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-22 01:40:41,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 01:40:41,384 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-22 01:40:41,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:41,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,442 INFO L229 MonitoredProcess]: Starting monitored process 42 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-22 01:40:41,450 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-22 01:40:41,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 01:40:41,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 01:40:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,487 INFO L229 MonitoredProcess]: Starting monitored process 43 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-22 01:40:41,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:40:41,491 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-22 01:40:41,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 01:40:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,518 INFO L229 MonitoredProcess]: Starting monitored process 44 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-22 01:40:41,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:40:41,520 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-22 01:40:41,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 01:40:41,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,566 INFO L229 MonitoredProcess]: Starting monitored process 45 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-22 01:40:41,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 01:40:41,569 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-22 01:40:41,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 01:40:41,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,609 INFO L229 MonitoredProcess]: Starting monitored process 46 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-22 01:40:41,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 01:40:41,612 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-22 01:40:41,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 01:40:41,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,640 INFO L229 MonitoredProcess]: Starting monitored process 47 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-22 01:40:41,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 01:40:41,642 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-22 01:40:41,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:41,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 01:40:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,668 INFO L229 MonitoredProcess]: Starting monitored process 48 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-22 01:40:41,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 01:40:41,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:41,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:41,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:41,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:41,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:41,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:41,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:41,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:41,705 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 01:40:41,705 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 01:40:41,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:41,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:41,707 INFO L229 MonitoredProcess]: Starting monitored process 49 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-22 01:40:41,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 01:40:41,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:41,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:41,716 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:41,716 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3 Supporting invariants [] [2022-07-22 01:40:41,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 01:40:41,861 INFO L293 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-22 01:40:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:41,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:40:41,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:40:41,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:41,953 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-22 01:40:41,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-07-22 01:40:41,970 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-22 01:40:41,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:40:41,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 01:40:41,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Result 30 states and 35 transitions. Complement of second has 7 states. [2022-07-22 01:40:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 01:40:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-22 01:40:41,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-22 01:40:41,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:41,983 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:40:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:42,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:40:42,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:42,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:40:42,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:42,076 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-22 01:40:42,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-07-22 01:40:42,095 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-22 01:40:42,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:40:42,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 01:40:42,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Result 51 states and 59 transitions. Complement of second has 9 states. [2022-07-22 01:40:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 01:40:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-07-22 01:40:42,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-22 01:40:42,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:42,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2022-07-22 01:40:42,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:42,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2022-07-22 01:40:42,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:42,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2022-07-22 01:40:42,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:42,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2022-07-22 01:40:42,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-22 01:40:42,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-22 01:40:42,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2022-07-22 01:40:42,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:42,119 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-07-22 01:40:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2022-07-22 01:40:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-22 01:40:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-22 01:40:42,121 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-22 01:40:42,121 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-22 01:40:42,121 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:40:42,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2022-07-22 01:40:42,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:40:42,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:42,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:42,122 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:42,122 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:42,122 INFO L752 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 1123#L569 goto; 1124#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1136#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1131#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1132#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1154#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1153#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 1152#L564 goto; 1150#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1137#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1138#L566 assume 0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2);havoc f_#t~mem14#1; 1144#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1146#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1143#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 1142#L569 goto; 1130#L560 [2022-07-22 01:40:42,122 INFO L754 eck$LassoCheckResult]: Loop: 1130#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1135#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1129#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1130#L560 [2022-07-22 01:40:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2022-07-22 01:40:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:42,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368665606] [2022-07-22 01:40:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:40:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:42,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368665606] [2022-07-22 01:40:42,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368665606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:40:42,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433756910] [2022-07-22 01:40:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:42,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:40:42,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:42,166 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:40:42,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:42,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-07-22 01:40:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:42,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 01:40:42,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:42,579 INFO L356 Elim1Store]: treesize reduction 324, result has 30.9 percent of original size [2022-07-22 01:40:42,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 633 [2022-07-22 01:40:42,618 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 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 01:40:42,640 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 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 01:40:42,656 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 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 01:40:42,671 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 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 01:40:42,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:42,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:42,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:42,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:42,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,025 INFO L356 Elim1Store]: treesize reduction 125, result has 12.0 percent of original size [2022-07-22 01:40:43,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 304 [2022-07-22 01:40:43,074 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 9 treesize of output 7 [2022-07-22 01:40:43,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,214 INFO L356 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2022-07-22 01:40:43,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 167 treesize of output 291 [2022-07-22 01:40:43,265 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 9 treesize of output 7 [2022-07-22 01:40:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:43,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 288 [2022-07-22 01:40:43,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,476 INFO L356 Elim1Store]: treesize reduction 81, result has 9.0 percent of original size [2022-07-22 01:40:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 174 treesize of output 296 [2022-07-22 01:40:43,546 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 9 treesize of output 7 [2022-07-22 01:40:43,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:43,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:43,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,642 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-07-22 01:40:43,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 181 treesize of output 293 [2022-07-22 01:40:43,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:43,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:40:43,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 293 [2022-07-22 01:40:43,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:40:43,776 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-07-22 01:40:43,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 155 treesize of output 269 [2022-07-22 01:40:43,783 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 9 treesize of output 7 [2022-07-22 01:41:58,363 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 01:41:58,364 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:975) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:409) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:409) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:409) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:885) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:840) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:755) 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-22 01:41:58,367 INFO L158 Benchmark]: Toolchain (without parser) took 89955.85ms. Allocated memory was 69.2MB in the beginning and 461.4MB in the end (delta: 392.2MB). Free memory was 42.9MB in the beginning and 270.8MB in the end (delta: -228.0MB). Peak memory consumption was 284.3MB. Max. memory is 16.1GB. [2022-07-22 01:41:58,367 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:41:58,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.21ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 48.0MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 01:41:58,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.68ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 45.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:41:58,367 INFO L158 Benchmark]: Boogie Preprocessor took 52.12ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 44.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:41:58,368 INFO L158 Benchmark]: RCFGBuilder took 341.36ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 32.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:41:58,371 INFO L158 Benchmark]: BuchiAutomizer took 89135.30ms. Allocated memory was 69.2MB in the beginning and 461.4MB in the end (delta: 392.2MB). Free memory was 32.5MB in the beginning and 270.8MB in the end (delta: -238.4MB). Peak memory consumption was 277.3MB. Max. memory is 16.1GB. [2022-07-22 01:41:58,372 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 39.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.21ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 48.0MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.68ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 45.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.12ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 44.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.36ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 32.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 89135.30ms. Allocated memory was 69.2MB in the beginning and 461.4MB in the end (delta: 392.2MB). Free memory was 32.5MB in the beginning and 270.8MB in the end (delta: -238.4MB). Peak memory consumption was 277.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 01:41:58,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-07-22 01:41:58,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-22 01:41:58,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @2a551a63)