./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-f4b24e3 [2022-07-14 15:02:28,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:02:28,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:02:28,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:02:28,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:02:28,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:02:28,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:02:28,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:02:28,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:02:28,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:02:28,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:02:28,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:02:28,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:02:28,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:02:28,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:02:28,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:02:28,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:02:28,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:02:28,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:02:28,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:02:28,779 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:02:28,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:02:28,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:02:28,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:02:28,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:02:28,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:02:28,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:02:28,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:02:28,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:02:28,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:02:28,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:02:28,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:02:28,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:02:28,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:02:28,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:02:28,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:02:28,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:02:28,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:02:28,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:02:28,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:02:28,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:02:28,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:02:28,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:02:28,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:02:28,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:02:28,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:02:28,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:02:28,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:02:28,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:02:28,817 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:02:28,817 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:02:28,817 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:02:28,818 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:02:28,818 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:02:28,818 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:02:28,818 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:02:28,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:02:28,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:02:28,820 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:02:28,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:02:28,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:02:28,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:02:28,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:02:28,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:02:28,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:02:28,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:02:28,822 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-14 15:02:29,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:02:29,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:02:29,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:02:29,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:02:29,028 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:02:29,029 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-14 15:02:29,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acc51b6d/251e498f172044449533b73b46b01784/FLAGdfa0f5b20 [2022-07-14 15:02:29,473 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:02:29,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-07-14 15:02:29,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acc51b6d/251e498f172044449533b73b46b01784/FLAGdfa0f5b20 [2022-07-14 15:02:29,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acc51b6d/251e498f172044449533b73b46b01784 [2022-07-14 15:02:29,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:02:29,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:02:29,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:02:29,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:02:29,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:02:29,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d2757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29, skipping insertion in model container [2022-07-14 15:02:29,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:02:29,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:02:29,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:02:29,756 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:02:29,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:02:29,820 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:02:29,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29 WrapperNode [2022-07-14 15:02:29,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:02:29,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:02:29,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:02:29,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:02:29,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,852 INFO L137 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-07-14 15:02:29,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:02:29,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:02:29,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:02:29,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:02:29,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:02:29,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:02:29,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:02:29,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:02:29,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (1/1) ... [2022-07-14 15:02:29,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:29,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:29,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:29,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:02:29,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:02:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:02:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:02:29,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:02:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:02:29,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:02:30,008 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:02:30,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:02:30,153 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:02:30,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:02:30,157 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:02:30,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:02:30 BoogieIcfgContainer [2022-07-14 15:02:30,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:02:30,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:02:30,162 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:02:30,164 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:02:30,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:30,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:02:29" (1/3) ... [2022-07-14 15:02:30,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@222f5235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:02:30, skipping insertion in model container [2022-07-14 15:02:30,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:30,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:02:29" (2/3) ... [2022-07-14 15:02:30,167 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@222f5235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:02:30, skipping insertion in model container [2022-07-14 15:02:30,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:02:30,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:02:30" (3/3) ... [2022-07-14 15:02:30,168 INFO L354 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2022-07-14 15:02:30,207 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:02:30,207 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:02:30,207 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:02:30,207 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:02:30,207 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:02:30,207 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:02:30,207 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:02:30,207 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:02:30,210 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-14 15:02:30,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:02:30,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:30,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:30,223 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:02:30,223 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:02:30,223 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:02:30,223 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-14 15:02:30,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:02:30,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:30,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:30,225 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:02:30,225 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-14 15:02:30,229 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-14 15:02:30,229 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-14 15:02:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:02:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:30,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619630952] [2022-07-14 15:02:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2022-07-14 15:02:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:30,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066924848] [2022-07-14 15:02:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:30,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066924848] [2022-07-14 15:02:30,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066924848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:02:30,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:02:30,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 15:02:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2858940] [2022-07-14 15:02:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:02:30,454 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:02:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:02:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:02:30,473 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-14 15:02:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:30,477 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-14 15:02:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:02:30,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-14 15:02:30,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:02:30,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2022-07-14 15:02:30,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-14 15:02:30,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-14 15:02:30,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-07-14 15:02:30,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:02:30,484 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-14 15:02:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-07-14 15:02:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-14 15:02:30,498 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-14 15:02:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-14 15:02:30,499 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-14 15:02:30,499 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-14 15:02:30,499 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:02:30,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-07-14 15:02:30,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 15:02:30,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:30,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:30,500 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:02:30,500 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:30,500 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-14 15:02:30,500 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-14 15:02:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:02:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:30,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029184213] [2022-07-14 15:02:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2022-07-14 15:02:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945436427] [2022-07-14 15:02:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2022-07-14 15:02:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840171580] [2022-07-14 15:02:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:30,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:32,213 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:02:32,214 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:02:32,214 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:02:32,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:02:32,214 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:02:32,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:32,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:02:32,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:02:32,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2022-07-14 15:02:32,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:02:32,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:02:32,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:32,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:33,258 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:02:33,261 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:02:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:02:33,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:33,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:33,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:33,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,312 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-14 15:02:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:02: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-14 15:02:33,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:33,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:33,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:33,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:02:33,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:02:33,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:02:33,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:02:33,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:33,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:33,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:33,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:02:33,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:33,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:33,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:33,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 15:02:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:02:33,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,623 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-14 15:02:33,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:02:33,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-14 15:02:33,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:02:33,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,710 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:02:33,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,752 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-14 15:02:33,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,753 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 15:02:33,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,818 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-14 15:02:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,820 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:02:33,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,856 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 15:02:33,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,904 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 15:02:33,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:33,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:33,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:33,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:33,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:33,976 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:33,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 15:02:33,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:33,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:33,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:33,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:33,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:33,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:33,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:34,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:34,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:34,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:34,019 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:02:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:02:34,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:34,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:34,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:34,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:34,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:34,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:34,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:34,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:02:34,070 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-14 15:02:34,071 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-14 15:02:34,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:34,091 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-14 15:02:34,093 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-14 15:02:34,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:02:34,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:02:34,144 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:02:34,144 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-14 15:02:34,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:34,287 INFO L293 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-07-14 15:02:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:34,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:02:34,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:34,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:02:34,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:34,409 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-14 15:02:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:34,426 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-14 15:02:34,427 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-14 15:02:34,453 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-14 15:02:34,453 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-14 15:02:34,454 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-14 15:02:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-07-14 15:02:34,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2022-07-14 15:02:34,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:34,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2022-07-14 15:02:34,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:34,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2022-07-14 15:02:34,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:34,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-14 15:02:34,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:34,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2022-07-14 15:02:34,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:02:34,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:02:34,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-07-14 15:02:34,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:34,459 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-07-14 15:02:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-07-14 15:02:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-07-14 15:02:34,460 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-14 15:02:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-07-14 15:02:34,461 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-14 15:02:34,461 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-07-14 15:02:34,461 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:02:34,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-07-14 15:02:34,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:34,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:34,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:34,462 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 15:02:34,462 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:34,462 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-14 15:02:34,462 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-14 15:02:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2022-07-14 15:02:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015322939] [2022-07-14 15:02:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-07-14 15:02:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:34,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947466610] [2022-07-14 15:02:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-07-14 15:02:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:34,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784492515] [2022-07-14 15:02:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:34,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:34,848 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-14 15:02:35,515 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:02:35,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:02:35,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:02:35,515 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:02:35,515 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:02:35,515 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:35,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:02:35,516 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:02:35,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2022-07-14 15:02:35,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:02:35,516 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:02:35,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:35,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,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-14 15:02:36,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-14 15:02:36,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:36,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-14 15:02:36,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-14 15:02:36,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-14 15:02:36,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:02:36,342 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:02:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,344 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-14 15:02:36,345 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-14 15:02:36,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:36,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:36,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:36,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,373 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-14 15:02:36,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,374 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-14 15:02:36,375 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-14 15:02:36,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:36,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:36,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:36,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,398 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-14 15:02:36,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,399 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-14 15:02:36,400 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-14 15:02:36,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,434 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-14 15:02:36,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,435 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-14 15:02:36,436 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-14 15:02:36,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,473 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-14 15:02:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,475 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-14 15:02:36,476 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-14 15:02:36,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:36,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:36,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:36,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,517 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-14 15:02:36,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,518 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-14 15:02:36,522 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-14 15:02:36,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:36,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:36,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:36,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,548 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-14 15:02:36,548 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-14 15:02:36,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,578 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-14 15:02:36,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,579 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-14 15:02:36,580 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-14 15:02:36,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,627 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-14 15:02:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,629 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-14 15:02:36,630 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-14 15:02:36,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,671 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-14 15:02:36,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,672 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-14 15:02:36,673 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-14 15:02:36,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,715 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-14 15:02:36,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,716 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-14 15:02:36,717 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-14 15:02:36,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,759 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-14 15:02:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,761 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-14 15:02:36,762 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-14 15:02:36,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,802 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-14 15:02:36,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,803 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-14 15:02:36,804 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-14 15:02:36,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 15:02:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,833 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-14 15:02:36,834 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-14 15:02:36,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:36,885 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-14 15:02:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,887 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-14 15:02:36,887 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-14 15:02:36,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:36,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:36,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:36,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:36,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:36,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:36,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:36,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:02:36,925 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 15:02:36,925 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-14 15:02:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:36,926 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-14 15:02:36,927 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-14 15:02:36,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:02:36,948 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-14 15:02:36,948 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:02:36,948 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-14 15:02:36,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 15:02:37,057 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-14 15:02:37,086 INFO L293 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2022-07-14 15:02:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:37,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-14 15:02:37,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:37,156 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-14 15:02:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:02:37,164 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-14 15:02:37,171 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-14 15:02:37,171 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-14 15:02:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:37,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:02:37,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:37,223 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-14 15:02:37,223 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-14 15:02:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:37,245 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-14 15:02:37,245 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-14 15:02:37,274 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-14 15:02:37,275 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-14 15:02:37,275 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-14 15:02:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-07-14 15:02:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-14 15:02:37,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-14 15:02:37,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-14 15:02:37,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:37,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2022-07-14 15:02:37,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:37,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2022-07-14 15:02:37,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:02:37,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 15:02:37,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-07-14 15:02:37,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:37,277 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-14 15:02:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-07-14 15:02:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-07-14 15:02:37,278 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-14 15:02:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-07-14 15:02:37,279 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-14 15:02:37,279 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-14 15:02:37,279 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:02:37,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-07-14 15:02:37,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:37,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:37,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:37,280 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:37,280 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:37,280 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-14 15:02:37,281 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-14 15:02:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2022-07-14 15:02:37,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:37,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333522016] [2022-07-14 15:02:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2022-07-14 15:02:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491357979] [2022-07-14 15:02:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:37,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2022-07-14 15:02:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:37,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101323682] [2022-07-14 15:02:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:37,485 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-14 15:02:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101323682] [2022-07-14 15:02:37,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101323682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:02:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903439290] [2022-07-14 15:02:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:02:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:37,487 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-14 15:02:37,488 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-14 15:02:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:37,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 15:02:37,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:37,562 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-14 15:02:37,612 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 15:02:37,612 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-14 15:02:37,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:02:37,638 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-14 15:02:37,675 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-14 15:02:37,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:02:37,738 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-14 15:02:37,738 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-14 15:02:37,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:02:37,747 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-14 15:02:37,778 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-14 15:02:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903439290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:02:37,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:02:37,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-14 15:02:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517691516] [2022-07-14 15:02:37,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:02:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:37,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 15:02:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2022-07-14 15:02:37,827 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-14 15:02:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:37,905 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-14 15:02:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 15:02:37,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2022-07-14 15:02:37,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:37,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 24 transitions. [2022-07-14 15:02:37,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:02:37,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 15:02:37,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-07-14 15:02:37,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:37,908 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-14 15:02:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-07-14 15:02:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-07-14 15:02:37,909 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-14 15:02:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-07-14 15:02:37,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-14 15:02:37,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-07-14 15:02:37,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:02:37,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-07-14 15:02:37,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:37,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:37,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:37,910 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:37,910 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:37,910 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-14 15:02:37,910 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-14 15:02:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2022-07-14 15:02:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204523115] [2022-07-14 15:02:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:37,966 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-14 15:02:37,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:37,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204523115] [2022-07-14 15:02:37,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204523115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:02:37,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:02:37,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:02:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439338803] [2022-07-14 15:02:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:02:37,967 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:02:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2022-07-14 15:02:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:37,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916858568] [2022-07-14 15:02:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:37,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:02:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:02:38,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:02:38,054 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-14 15:02:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:02:38,081 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-14 15:02:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:02:38,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-07-14 15:02:38,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:38,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 23 transitions. [2022-07-14 15:02:38,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:02:38,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 15:02:38,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2022-07-14 15:02:38,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:38,083 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-14 15:02:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2022-07-14 15:02:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-14 15:02:38,084 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-14 15:02:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-14 15:02:38,084 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-14 15:02:38,084 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-14 15:02:38,084 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:02:38,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-07-14 15:02:38,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:38,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:38,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:38,087 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:38,087 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:38,088 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-14 15:02:38,089 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-14 15:02:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2022-07-14 15:02:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:38,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750764453] [2022-07-14 15:02:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2022-07-14 15:02:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972516271] [2022-07-14 15:02:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2022-07-14 15:02:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:38,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582114092] [2022-07-14 15:02:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:02:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:02:38,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:02:40,030 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:02:40,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:02:40,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:02:40,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:02:40,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:02:40,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:40,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:02:40,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:02:40,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2022-07-14 15:02:40,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:02:40,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:02:40,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,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-14 15:02:40,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:02:40,954 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:02:40,954 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:02:40,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:40,955 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-14 15:02:40,956 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-14 15:02:40,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:40,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:40,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:02:40,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:40,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:40,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:40,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:02:40,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:02:40,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:40,984 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-14 15:02:40,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:40,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:40,986 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-14 15:02:40,986 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-14 15:02:40,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:40,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:40,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:40,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:40,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:40,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:40,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-14 15:02:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,016 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-14 15:02:41,017 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-14 15:02:41,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,044 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-14 15:02:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,045 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-14 15:02:41,046 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-14 15:02:41,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-14 15:02:41,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,075 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-14 15:02:41,076 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-14 15:02:41,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-14 15:02:41,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,104 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-14 15:02:41,105 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-14 15:02:41,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,132 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-14 15:02:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,134 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-14 15:02:41,135 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-14 15:02:41,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,161 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-14 15:02:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,162 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-14 15:02:41,162 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-14 15:02:41,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,199 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-14 15:02:41,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,200 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-14 15:02:41,201 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-14 15:02:41,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:41,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,228 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-14 15:02:41,228 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-14 15:02:41,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,253 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-14 15:02:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,255 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-14 15:02:41,255 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-14 15:02:41,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:02:41,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-14 15:02:41,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,292 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-14 15:02:41,292 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-14 15:02:41,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:02:41,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:02:41,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:02:41,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:02:41,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:02:41,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:02:41,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:02:41,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:02:41,328 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-14 15:02:41,328 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-14 15:02:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:02:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,329 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-14 15:02:41,330 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-14 15:02:41,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:02:41,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:02:41,337 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:02:41,337 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-14 15:02:41,353 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-14 15:02:41,442 INFO L293 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-14 15:02:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:02:41,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:02:41,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:41,536 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-14 15:02:41,536 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-14 15:02:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:41,554 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-14 15:02:41,554 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-14 15:02:41,568 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-14 15:02:41,569 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-14 15:02:41,570 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-14 15:02:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-14 15:02:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-14 15:02:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:41,572 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:02:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:02:41,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:02:41,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:41,671 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-14 15:02:41,671 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-14 15:02:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:02:41,688 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-14 15:02:41,688 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-14 15:02:41,713 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-14 15:02:41,713 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-14 15:02:41,714 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-14 15:02:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-07-14 15:02:41,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-14 15:02:41,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:41,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2022-07-14 15:02:41,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:41,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2022-07-14 15:02:41,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:02:41,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2022-07-14 15:02:41,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:41,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2022-07-14 15:02:41,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:02:41,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-14 15:02:41,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2022-07-14 15:02:41,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:02:41,721 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-07-14 15:02:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2022-07-14 15:02:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-14 15:02:41,724 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-14 15:02:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-14 15:02:41,725 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-14 15:02:41,725 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-14 15:02:41,725 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:02:41,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2022-07-14 15:02:41,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:02:41,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:02:41,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:02:41,727 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:02:41,727 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:02:41,727 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-14 15:02:41,727 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-14 15:02:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:02:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2022-07-14 15:02:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:02:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752347506] [2022-07-14 15:02:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:02:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,782 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-14 15:02:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:02:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752347506] [2022-07-14 15:02:41,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752347506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:02:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912470607] [2022-07-14 15:02:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:02:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:02:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:02:41,784 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-14 15:02:41,811 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-14 15:02:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:02:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 15:02:41,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:02:42,203 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-14 15:02:42,206 INFO L356 Elim1Store]: treesize reduction 324, result has 30.9 percent of original size [2022-07-14 15:02:42,206 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-14 15:02:42,231 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-14 15:02:42,250 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-14 15:02:42,266 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-14 15:02:42,281 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-14 15:03:57,564 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-14 15:03:57,565 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 3 case distinctions, treesize of input 79 treesize of output 55 [2022-07-14 15:03:57,577 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-14 15:03:57,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 15:03:57,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 15:03:57,680 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-14 15:03:57,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 275 treesize of output 213 [2022-07-14 15:03:57,834 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-14 15:03:57,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 15:03:57,925 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-14 15:03:57,925 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 3 case distinctions, treesize of input 97 treesize of output 59 [2022-07-14 15:03:58,352 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-14 15:03:58,364 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-14 15:03:58,747 INFO L356 Elim1Store]: treesize reduction 213, result has 17.8 percent of original size [2022-07-14 15:03:58,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 1442 treesize of output 1458 [2022-07-14 15:03:59,792 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-14 15:04:45,146 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-14 15:04:51,588 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-14 15:05:11,594 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-14 15:05:12,925 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-14 15:05:13,921 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-14 15:05:19,201 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-14 15:06:08,246 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-14 15:06:14,875 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-14 15:06:35,222 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-14 15:06:36,310 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-14 15:06:37,704 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