./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:45:10,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:45:10,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:45:10,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:45:10,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:45:10,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:45:10,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:45:10,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:45:10,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:45:10,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:45:10,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:45:10,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:45:10,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:45:10,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:45:10,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:45:10,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:45:10,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:45:10,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:45:10,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:45:10,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:45:10,934 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:45:10,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:45:10,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:45:10,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:45:10,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:45:10,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:45:10,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:45:10,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:45:10,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:45:10,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:45:10,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:45:10,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:45:10,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:45:10,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:45:10,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:45:10,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:45:10,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:45:10,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:45:10,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:45:10,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:45:10,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:45:10,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:45:10,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 01:45:10,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:45:10,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:45:10,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:45:10,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:45:10,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:45:10,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:45:10,999 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:45:10,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:45:11,000 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:45:11,000 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:45:11,001 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:45:11,001 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:45:11,001 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:45:11,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:45:11,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 01:45:11,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:45:11,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:45:11,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 01:45:11,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:45:11,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:45:11,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:45:11,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:45:11,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 01:45:11,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:45:11,003 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:45:11,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:45:11,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:45:11,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:45:11,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:45:11,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:45:11,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:45:11,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:45:11,007 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2022-07-22 01:45:11,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:45:11,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:45:11,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:45:11,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:45:11,312 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:45:11,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-07-22 01:45:11,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba413cf6/89de2bbaa65c439eb73a77be790b4e3e/FLAG2db1731a7 [2022-07-22 01:45:11,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:45:11,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-07-22 01:45:11,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba413cf6/89de2bbaa65c439eb73a77be790b4e3e/FLAG2db1731a7 [2022-07-22 01:45:11,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba413cf6/89de2bbaa65c439eb73a77be790b4e3e [2022-07-22 01:45:11,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:45:11,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:45:11,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:45:11,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:45:11,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:45:11,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:11" (1/1) ... [2022-07-22 01:45:11,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecb4f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:11, skipping insertion in model container [2022-07-22 01:45:11,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:11" (1/1) ... [2022-07-22 01:45:11,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:45:11,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:45:11,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-07-22 01:45:12,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:45:12,022 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:45:12,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-07-22 01:45:12,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:45:12,115 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:45:12,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12 WrapperNode [2022-07-22 01:45:12,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:45:12,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:45:12,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:45:12,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:45:12,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,191 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-07-22 01:45:12,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:45:12,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:45:12,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:45:12,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:45:12,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:45:12,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:45:12,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:45:12,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:45:12,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (1/1) ... [2022-07-22 01:45:12,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:12,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:12,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:45:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 01:45:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 01:45:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:45:12,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:45:12,428 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:45:12,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:45:12,924 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:45:12,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:45:12,929 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:45:12,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:12 BoogieIcfgContainer [2022-07-22 01:45:12,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:45:12,932 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:45:12,932 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:45:12,934 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:45:12,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:12,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:45:11" (1/3) ... [2022-07-22 01:45:12,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@164b4813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:45:12, skipping insertion in model container [2022-07-22 01:45:12,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:12,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:12" (2/3) ... [2022-07-22 01:45:12,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@164b4813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:45:12, skipping insertion in model container [2022-07-22 01:45:12,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:12,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:12" (3/3) ... [2022-07-22 01:45:12,938 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2022-07-22 01:45:12,978 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:45:12,978 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:45:12,978 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:45:12,978 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:45:12,979 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:45:12,979 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:45:12,979 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:45:12,979 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:45:12,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:13,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-22 01:45:13,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:13,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:13,009 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,010 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,010 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:45:13,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:13,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-22 01:45:13,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:13,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:13,019 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,019 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,025 INFO L752 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29#L59true assume !(0 == mp_add_~a3~0#1 % 256); 11#L59-1true mp_add_~nb~0#1 := 4; 12#L69true assume !(0 == mp_add_~b3~0#1 % 256); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14#L80-2true [2022-07-22 01:45:13,026 INFO L754 eck$LassoCheckResult]: Loop: 14#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15#L101-1true assume !(3 == mp_add_~i~0#1 % 256); 16#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14#L80-2true [2022-07-22 01:45:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-22 01:45:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:13,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367297393] [2022-07-22 01:45:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:13,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:13,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-22 01:45:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:13,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352079436] [2022-07-22 01:45:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:13,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352079436] [2022-07-22 01:45:13,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352079436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:13,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:13,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230098913] [2022-07-22 01:45:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:13,305 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:45:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:45:13,337 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:13,516 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-22 01:45:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:45:13,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-22 01:45:13,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-22 01:45:13,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-22 01:45:13,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-22 01:45:13,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-22 01:45:13,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-22 01:45:13,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:13,532 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-22 01:45:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-22 01:45:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-22 01:45:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.5) internal successors, (96), 63 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-22 01:45:13,559 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-22 01:45:13,559 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-22 01:45:13,560 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:45:13,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-22 01:45:13,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-22 01:45:13,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:13,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:13,562 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,562 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:13,562 INFO L752 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 139#L59 assume !(0 == mp_add_~a3~0#1 % 256); 140#L59-1 mp_add_~nb~0#1 := 4; 159#L69 assume !(0 == mp_add_~b3~0#1 % 256); 149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 165#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 166#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 194#L83-1 [2022-07-22 01:45:13,562 INFO L754 eck$LassoCheckResult]: Loop: 194#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 138#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 172#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 173#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 179#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 180#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 162#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 194#L83-1 [2022-07-22 01:45:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-22 01:45:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255237764] [2022-07-22 01:45:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255237764] [2022-07-22 01:45:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255237764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:13,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:13,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:45:13,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826651291] [2022-07-22 01:45:13,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:13,747 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-22 01:45:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:13,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596352662] [2022-07-22 01:45:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:13,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596352662] [2022-07-22 01:45:13,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596352662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:13,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:13,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:45:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534947481] [2022-07-22 01:45:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:13,797 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:45:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:45:13,799 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. cyclomatic complexity: 34 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:14,237 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2022-07-22 01:45:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:14,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 310 transitions. [2022-07-22 01:45:14,242 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-22 01:45:14,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 310 transitions. [2022-07-22 01:45:14,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-07-22 01:45:14,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-22 01:45:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 310 transitions. [2022-07-22 01:45:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:14,246 INFO L369 hiAutomatonCegarLoop]: Abstraction has 222 states and 310 transitions. [2022-07-22 01:45:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 310 transitions. [2022-07-22 01:45:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 79. [2022-07-22 01:45:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 78 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-22 01:45:14,259 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-22 01:45:14,259 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-22 01:45:14,259 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:45:14,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-22 01:45:14,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-22 01:45:14,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:14,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:14,261 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,262 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,262 INFO L752 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 442#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 444#L61 assume !(0 == mp_add_~a2~0#1 % 256); 445#L59-1 mp_add_~nb~0#1 := 4; 495#L69 assume !(0 == mp_add_~b3~0#1 % 256); 490#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 491#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 496#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 460#L83-1 [2022-07-22 01:45:14,262 INFO L754 eck$LassoCheckResult]: Loop: 460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 455#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 456#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 480#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 489#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 512#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 469#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 474#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 460#L83-1 [2022-07-22 01:45:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-22 01:45:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10057961] [2022-07-22 01:45:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:14,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10057961] [2022-07-22 01:45:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10057961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:14,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:14,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341433371] [2022-07-22 01:45:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:14,301 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-22 01:45:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689909479] [2022-07-22 01:45:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:14,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689909479] [2022-07-22 01:45:14,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689909479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:14,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:14,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:45:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049333451] [2022-07-22 01:45:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:14,343 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:45:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:45:14,344 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:14,348 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2022-07-22 01:45:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:45:14,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2022-07-22 01:45:14,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-22 01:45:14,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2022-07-22 01:45:14,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 01:45:14,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 01:45:14,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2022-07-22 01:45:14,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:14,352 INFO L369 hiAutomatonCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-22 01:45:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2022-07-22 01:45:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-22 01:45:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 67 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-07-22 01:45:14,356 INFO L392 hiAutomatonCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-22 01:45:14,356 INFO L374 stractBuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-07-22 01:45:14,356 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:45:14,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2022-07-22 01:45:14,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-22 01:45:14,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:14,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:14,358 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,358 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,358 INFO L752 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 597#L59 assume !(0 == mp_add_~a3~0#1 % 256); 598#L59-1 mp_add_~nb~0#1 := 4; 619#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 604#L71 assume !(0 == mp_add_~b2~0#1 % 256); 605#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 664#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 663#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 662#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 655#L84-2 [2022-07-22 01:45:14,359 INFO L754 eck$LassoCheckResult]: Loop: 655#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 661#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 656#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 599#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 601#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 620#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 607#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 608#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 631#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 634#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 638#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 650#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 655#L84-2 [2022-07-22 01:45:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 1 times [2022-07-22 01:45:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334640468] [2022-07-22 01:45:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1921567616, now seen corresponding path program 3 times [2022-07-22 01:45:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328839016] [2022-07-22 01:45:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:14,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328839016] [2022-07-22 01:45:14,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328839016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:14,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:14,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308232332] [2022-07-22 01:45:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:14,442 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:14,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:14,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:45:14,443 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 29 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:14,571 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2022-07-22 01:45:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:45:14,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 142 transitions. [2022-07-22 01:45:14,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2022-07-22 01:45:14,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 142 transitions. [2022-07-22 01:45:14,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-22 01:45:14,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-22 01:45:14,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 142 transitions. [2022-07-22 01:45:14,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:14,575 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 142 transitions. [2022-07-22 01:45:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 142 transitions. [2022-07-22 01:45:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2022-07-22 01:45:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2022-07-22 01:45:14,580 INFO L392 hiAutomatonCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-22 01:45:14,580 INFO L374 stractBuchiCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-22 01:45:14,581 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:45:14,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 128 transitions. [2022-07-22 01:45:14,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2022-07-22 01:45:14,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:14,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:14,582 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,582 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,583 INFO L752 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 770#L59 assume !(0 == mp_add_~a3~0#1 % 256); 771#L59-1 mp_add_~nb~0#1 := 4; 790#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 777#L71 assume !(0 == mp_add_~b2~0#1 % 256); 778#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 814#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 811#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 812#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 815#L84-2 [2022-07-22 01:45:14,583 INFO L754 eck$LassoCheckResult]: Loop: 815#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 816#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 784#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 785#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 772#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 774#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 791#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 780#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 781#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 805#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 806#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 821#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 834#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 850#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 824#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 822#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 823#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 803#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 804#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 846#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 845#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 844#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 815#L84-2 [2022-07-22 01:45:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 2 times [2022-07-22 01:45:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881195332] [2022-07-22 01:45:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 93570923, now seen corresponding path program 1 times [2022-07-22 01:45:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677957109] [2022-07-22 01:45:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 01:45:14,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:14,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677957109] [2022-07-22 01:45:14,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677957109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:14,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:14,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807424941] [2022-07-22 01:45:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:14,658 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:14,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:45:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:45:14,661 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:14,742 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2022-07-22 01:45:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:45:14,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 174 transitions. [2022-07-22 01:45:14,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2022-07-22 01:45:14,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 174 transitions. [2022-07-22 01:45:14,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-07-22 01:45:14,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-07-22 01:45:14,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 174 transitions. [2022-07-22 01:45:14,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:14,747 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 174 transitions. [2022-07-22 01:45:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 174 transitions. [2022-07-22 01:45:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-07-22 01:45:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 122 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-07-22 01:45:14,752 INFO L392 hiAutomatonCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-07-22 01:45:14,752 INFO L374 stractBuchiCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-07-22 01:45:14,752 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:45:14,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 172 transitions. [2022-07-22 01:45:14,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 104 [2022-07-22 01:45:14,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:14,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:14,754 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,754 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,755 INFO L752 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1004#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 991#L59 assume !(0 == mp_add_~a3~0#1 % 256); 992#L59-1 mp_add_~nb~0#1 := 4; 1011#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 998#L71 assume !(0 == mp_add_~b2~0#1 % 256); 999#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1106#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1101#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1063#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1061#L84-2 [2022-07-22 01:45:14,755 INFO L754 eck$LassoCheckResult]: Loop: 1061#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1059#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1058#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1056#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1044#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1043#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1042#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1041#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1040#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1036#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1037#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1006#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 993#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 995#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1035#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1001#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1002#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1025#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1039#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1086#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1061#L84-2 [2022-07-22 01:45:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 3 times [2022-07-22 01:45:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002071686] [2022-07-22 01:45:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:14,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash 150829225, now seen corresponding path program 1 times [2022-07-22 01:45:14,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090968949] [2022-07-22 01:45:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 01:45:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090968949] [2022-07-22 01:45:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090968949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:14,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:14,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814491109] [2022-07-22 01:45:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:14,831 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:45:14,832 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. cyclomatic complexity: 51 Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:14,976 INFO L93 Difference]: Finished difference Result 174 states and 242 transitions. [2022-07-22 01:45:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:45:14,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 242 transitions. [2022-07-22 01:45:14,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2022-07-22 01:45:14,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 242 transitions. [2022-07-22 01:45:14,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-22 01:45:14,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-22 01:45:14,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 242 transitions. [2022-07-22 01:45:14,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:14,981 INFO L369 hiAutomatonCegarLoop]: Abstraction has 174 states and 242 transitions. [2022-07-22 01:45:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 242 transitions. [2022-07-22 01:45:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 120. [2022-07-22 01:45:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.4) internal successors, (168), 119 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2022-07-22 01:45:14,986 INFO L392 hiAutomatonCegarLoop]: Abstraction has 120 states and 168 transitions. [2022-07-22 01:45:14,986 INFO L374 stractBuchiCegarLoop]: Abstraction has 120 states and 168 transitions. [2022-07-22 01:45:14,987 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:45:14,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 168 transitions. [2022-07-22 01:45:14,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 101 [2022-07-22 01:45:14,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:14,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:14,988 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,989 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:14,989 INFO L752 eck$LassoCheckResult]: Stem: 1323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1298#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1299#L59-1 mp_add_~nb~0#1 := 4; 1318#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1305#L71 assume !(0 == mp_add_~b2~0#1 % 256); 1306#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1325#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1326#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1407#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1399#L84-2 [2022-07-22 01:45:14,989 INFO L754 eck$LassoCheckResult]: Loop: 1399#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1404#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1401#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1386#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1381#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1341#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1319#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1308#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1309#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1331#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1332#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1337#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1313#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1357#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1355#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1354#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1352#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1350#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1349#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1347#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1348#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1377#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1399#L84-2 [2022-07-22 01:45:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 4 times [2022-07-22 01:45:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988851807] [2022-07-22 01:45:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:15,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:15,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1868578285, now seen corresponding path program 1 times [2022-07-22 01:45:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819692743] [2022-07-22 01:45:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 01:45:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819692743] [2022-07-22 01:45:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819692743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:15,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:15,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818303338] [2022-07-22 01:45:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:15,064 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:15,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:45:15,065 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. cyclomatic complexity: 50 Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:15,231 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2022-07-22 01:45:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:45:15,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 311 transitions. [2022-07-22 01:45:15,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 201 [2022-07-22 01:45:15,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 311 transitions. [2022-07-22 01:45:15,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2022-07-22 01:45:15,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2022-07-22 01:45:15,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 311 transitions. [2022-07-22 01:45:15,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:15,236 INFO L369 hiAutomatonCegarLoop]: Abstraction has 220 states and 311 transitions. [2022-07-22 01:45:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 311 transitions. [2022-07-22 01:45:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 177. [2022-07-22 01:45:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.423728813559322) internal successors, (252), 176 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 252 transitions. [2022-07-22 01:45:15,245 INFO L392 hiAutomatonCegarLoop]: Abstraction has 177 states and 252 transitions. [2022-07-22 01:45:15,245 INFO L374 stractBuchiCegarLoop]: Abstraction has 177 states and 252 transitions. [2022-07-22 01:45:15,245 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:45:15,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 252 transitions. [2022-07-22 01:45:15,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2022-07-22 01:45:15,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:15,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:15,247 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:15,247 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:15,248 INFO L752 eck$LassoCheckResult]: Stem: 1677#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1654#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1655#L59-1 mp_add_~nb~0#1 := 4; 1671#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 1658#L71 assume !(0 == mp_add_~b2~0#1 % 256); 1659#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1680#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1681#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1674#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1675#L84-2 [2022-07-22 01:45:15,248 INFO L754 eck$LassoCheckResult]: Loop: 1675#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1782#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1779#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1749#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1748#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1698#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1672#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1656#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1657#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1687#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1765#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1763#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1715#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1713#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1712#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1709#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1707#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1706#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1704#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1705#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1735#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1675#L84-2 [2022-07-22 01:45:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 5 times [2022-07-22 01:45:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746097920] [2022-07-22 01:45:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:15,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:15,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1925836587, now seen corresponding path program 1 times [2022-07-22 01:45:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:15,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280964506] [2022-07-22 01:45:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280964506] [2022-07-22 01:45:15,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280964506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:15,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869202758] [2022-07-22 01:45:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:15,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:15,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 01:45:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:15,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:15,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:15,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869202758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:15,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:15,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-07-22 01:45:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120646869] [2022-07-22 01:45:15,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:15,890 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 01:45:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 01:45:15,892 INFO L87 Difference]: Start difference. First operand 177 states and 252 transitions. cyclomatic complexity: 77 Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:16,375 INFO L93 Difference]: Finished difference Result 327 states and 450 transitions. [2022-07-22 01:45:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:45:16,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 450 transitions. [2022-07-22 01:45:16,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 273 [2022-07-22 01:45:16,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 327 states and 450 transitions. [2022-07-22 01:45:16,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2022-07-22 01:45:16,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2022-07-22 01:45:16,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 450 transitions. [2022-07-22 01:45:16,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:16,381 INFO L369 hiAutomatonCegarLoop]: Abstraction has 327 states and 450 transitions. [2022-07-22 01:45:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 450 transitions. [2022-07-22 01:45:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2022-07-22 01:45:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 213 states have (on average 1.403755868544601) internal successors, (299), 212 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-22 01:45:16,395 INFO L392 hiAutomatonCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-22 01:45:16,396 INFO L374 stractBuchiCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-22 01:45:16,401 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:45:16,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 299 transitions. [2022-07-22 01:45:16,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 185 [2022-07-22 01:45:16,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:16,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:16,403 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:16,404 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-22 01:45:16,405 INFO L752 eck$LassoCheckResult]: Stem: 2328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2307#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2308#L59-1 mp_add_~nb~0#1 := 4; 2322#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 2311#L71 assume !(0 == mp_add_~b2~0#1 % 256); 2312#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2438#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2437#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2434#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2433#L84-2 [2022-07-22 01:45:16,405 INFO L754 eck$LassoCheckResult]: Loop: 2433#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2432#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2430#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2427#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2424#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2413#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2411#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2410#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2409#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2408#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2405#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2402#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2396#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2391#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2389#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2382#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 2381#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2380#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2379#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2378#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2376#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2375#L84 assume !(0 == mp_add_~i~0#1 % 256); 2373#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2371#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2367#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2364#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2360#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2358#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2357#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2356#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2355#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2354#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2352#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2353#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2422#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2433#L84-2 [2022-07-22 01:45:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 6 times [2022-07-22 01:45:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055356201] [2022-07-22 01:45:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:16,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:16,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1960379948, now seen corresponding path program 1 times [2022-07-22 01:45:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26400972] [2022-07-22 01:45:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26400972] [2022-07-22 01:45:16,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26400972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:16,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:16,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 01:45:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90813110] [2022-07-22 01:45:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:16,516 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:45:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:45:16,517 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. cyclomatic complexity: 88 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:16,793 INFO L93 Difference]: Finished difference Result 448 states and 621 transitions. [2022-07-22 01:45:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:16,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 621 transitions. [2022-07-22 01:45:16,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 392 [2022-07-22 01:45:16,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 445 states and 617 transitions. [2022-07-22 01:45:16,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 445 [2022-07-22 01:45:16,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 445 [2022-07-22 01:45:16,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 445 states and 617 transitions. [2022-07-22 01:45:16,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:16,804 INFO L369 hiAutomatonCegarLoop]: Abstraction has 445 states and 617 transitions. [2022-07-22 01:45:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states and 617 transitions. [2022-07-22 01:45:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 372. [2022-07-22 01:45:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 372 states have (on average 1.403225806451613) internal successors, (522), 371 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 522 transitions. [2022-07-22 01:45:16,813 INFO L392 hiAutomatonCegarLoop]: Abstraction has 372 states and 522 transitions. [2022-07-22 01:45:16,813 INFO L374 stractBuchiCegarLoop]: Abstraction has 372 states and 522 transitions. [2022-07-22 01:45:16,813 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 01:45:16,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 522 transitions. [2022-07-22 01:45:16,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 344 [2022-07-22 01:45:16,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:16,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:16,817 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:16,817 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-22 01:45:16,819 INFO L752 eck$LassoCheckResult]: Stem: 3007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2981#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2982#L59-1 mp_add_~nb~0#1 := 4; 3001#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 2988#L71 assume !(0 == mp_add_~b2~0#1 % 256); 2989#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3025#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3146#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3137#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3135#L84-2 [2022-07-22 01:45:16,819 INFO L754 eck$LassoCheckResult]: Loop: 3135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3134#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3132#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3128#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3123#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3121#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3120#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3119#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3118#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3045#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3046#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3117#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3116#L84 assume !(0 == mp_add_~i~0#1 % 256); 3115#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 3114#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3112#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3108#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3103#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3101#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3100#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 3099#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3098#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3097#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3096#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3094#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3093#L84 assume !(0 == mp_add_~i~0#1 % 256); 3092#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3091#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3087#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3082#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3084#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3251#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3054#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3052#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3049#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3050#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3038#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3039#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3147#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3135#L84-2 [2022-07-22 01:45:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 7 times [2022-07-22 01:45:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766949355] [2022-07-22 01:45:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:16,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:16,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1024241828, now seen corresponding path program 1 times [2022-07-22 01:45:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129155731] [2022-07-22 01:45:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129155731] [2022-07-22 01:45:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129155731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553208256] [2022-07-22 01:45:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:16,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:16,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 01:45:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:17,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 01:45:17,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:45:17,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:45:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553208256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:17,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-07-22 01:45:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071706022] [2022-07-22 01:45:17,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:17,147 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 01:45:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-22 01:45:17,148 INFO L87 Difference]: Start difference. First operand 372 states and 522 transitions. cyclomatic complexity: 153 Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:17,657 INFO L93 Difference]: Finished difference Result 599 states and 800 transitions. [2022-07-22 01:45:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:45:17,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 800 transitions. [2022-07-22 01:45:17,662 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 564 [2022-07-22 01:45:17,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 598 states and 799 transitions. [2022-07-22 01:45:17,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 598 [2022-07-22 01:45:17,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 598 [2022-07-22 01:45:17,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 799 transitions. [2022-07-22 01:45:17,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:17,667 INFO L369 hiAutomatonCegarLoop]: Abstraction has 598 states and 799 transitions. [2022-07-22 01:45:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 799 transitions. [2022-07-22 01:45:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 364. [2022-07-22 01:45:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 364 states have (on average 1.3626373626373627) internal successors, (496), 363 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 496 transitions. [2022-07-22 01:45:17,674 INFO L392 hiAutomatonCegarLoop]: Abstraction has 364 states and 496 transitions. [2022-07-22 01:45:17,674 INFO L374 stractBuchiCegarLoop]: Abstraction has 364 states and 496 transitions. [2022-07-22 01:45:17,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 01:45:17,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 496 transitions. [2022-07-22 01:45:17,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 336 [2022-07-22 01:45:17,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:17,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:17,678 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:17,678 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:17,678 INFO L752 eck$LassoCheckResult]: Stem: 4232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 4217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4209#L59 assume !(0 == mp_add_~a3~0#1 % 256); 4210#L59-1 mp_add_~nb~0#1 := 4; 4224#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4213#L71 assume !(0 == mp_add_~b2~0#1 % 256); 4214#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4331#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4329#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4330#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4395#L84-2 [2022-07-22 01:45:17,678 INFO L754 eck$LassoCheckResult]: Loop: 4395#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4531#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4530#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4308#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4307#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4282#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4283#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4278#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4279#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4274#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4275#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4524#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4544#L84 assume !(0 == mp_add_~i~0#1 % 256); 4520#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 4393#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4518#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4514#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4511#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4509#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4499#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4364#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4365#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4328#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4316#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4247#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4219#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4204#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4206#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4225#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4226#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4260#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4318#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4302#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4472#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4469#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4450#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4211#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4212#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 4437#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4233#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4234#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4523#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4375#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4532#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4464#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4239#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4240#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4241#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4389#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4376#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4370#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4367#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4368#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4413#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4412#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4411#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4410#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4409#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4408#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4336#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4263#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4261#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4259#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4258#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4257#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4255#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4256#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4394#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4395#L84-2 [2022-07-22 01:45:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 8 times [2022-07-22 01:45:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971597837] [2022-07-22 01:45:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:17,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:17,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:17,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1261898314, now seen corresponding path program 1 times [2022-07-22 01:45:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420535399] [2022-07-22 01:45:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 01:45:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420535399] [2022-07-22 01:45:17,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420535399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:17,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276703272] [2022-07-22 01:45:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:17,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:17,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:17,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 01:45:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:17,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:45:17,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 01:45:17,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 01:45:18,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276703272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:18,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:18,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-22 01:45:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44469776] [2022-07-22 01:45:18,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:18,003 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:45:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:45:18,004 INFO L87 Difference]: Start difference. First operand 364 states and 496 transitions. cyclomatic complexity: 135 Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:18,147 INFO L93 Difference]: Finished difference Result 776 states and 1026 transitions. [2022-07-22 01:45:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:18,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 776 states and 1026 transitions. [2022-07-22 01:45:18,153 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 739 [2022-07-22 01:45:18,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 776 states to 776 states and 1026 transitions. [2022-07-22 01:45:18,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 776 [2022-07-22 01:45:18,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 776 [2022-07-22 01:45:18,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 776 states and 1026 transitions. [2022-07-22 01:45:18,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:18,159 INFO L369 hiAutomatonCegarLoop]: Abstraction has 776 states and 1026 transitions. [2022-07-22 01:45:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states and 1026 transitions. [2022-07-22 01:45:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 463. [2022-07-22 01:45:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.3585313174946003) internal successors, (629), 462 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 629 transitions. [2022-07-22 01:45:18,178 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 629 transitions. [2022-07-22 01:45:18,178 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 629 transitions. [2022-07-22 01:45:18,178 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 01:45:18,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 629 transitions. [2022-07-22 01:45:18,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 435 [2022-07-22 01:45:18,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:18,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:18,182 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,182 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,182 INFO L752 eck$LassoCheckResult]: Stem: 5809#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 5796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5780#L59 assume !(0 == mp_add_~a3~0#1 % 256); 5781#L59-1 mp_add_~nb~0#1 := 4; 5803#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 5789#L71 assume !(0 == mp_add_~b2~0#1 % 256); 5790#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5886#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5887#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6141#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5837#L84-2 [2022-07-22 01:45:18,182 INFO L754 eck$LassoCheckResult]: Loop: 5837#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6139#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6137#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6134#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6130#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6131#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6146#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6145#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6132#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6128#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6126#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6123#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5807#L84 assume !(0 == mp_add_~i~0#1 % 256); 5808#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 6057#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6205#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6204#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5782#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5783#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 5794#L96-8 mp_add_~carry~0#1 := 1; 5795#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6224#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5885#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6211#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6190#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6191#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6184#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6183#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5788#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6216#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6215#L96-8 mp_add_~carry~0#1 := 1; 6214#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6213#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6207#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 5848#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6195#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6066#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5798#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6199#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6196#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6182#L96-8 mp_add_~carry~0#1 := 1; 6156#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6153#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6150#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6147#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6109#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6107#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6104#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6101#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6030#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6077#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6072#L96-8 mp_add_~carry~0#1 := 1; 6069#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6063#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6062#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6061#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5877#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6035#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6033#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6031#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6026#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6023#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6022#L96-8 mp_add_~carry~0#1 := 1; 5888#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5889#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5883#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5882#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5876#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5875#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5871#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5866#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5868#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5880#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5850#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5852#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5845#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5846#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5841#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5839#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5836#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5837#L84-2 [2022-07-22 01:45:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 9 times [2022-07-22 01:45:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486156589] [2022-07-22 01:45:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -946314949, now seen corresponding path program 1 times [2022-07-22 01:45:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837243121] [2022-07-22 01:45:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 01:45:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:18,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837243121] [2022-07-22 01:45:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837243121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:18,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:18,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:45:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23835650] [2022-07-22 01:45:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:18,228 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:45:18,228 INFO L87 Difference]: Start difference. First operand 463 states and 629 transitions. cyclomatic complexity: 169 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:18,282 INFO L93 Difference]: Finished difference Result 639 states and 830 transitions. [2022-07-22 01:45:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:45:18,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 830 transitions. [2022-07-22 01:45:18,288 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 553 [2022-07-22 01:45:18,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 587 states and 778 transitions. [2022-07-22 01:45:18,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2022-07-22 01:45:18,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2022-07-22 01:45:18,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 587 states and 778 transitions. [2022-07-22 01:45:18,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:18,292 INFO L369 hiAutomatonCegarLoop]: Abstraction has 587 states and 778 transitions. [2022-07-22 01:45:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 778 transitions. [2022-07-22 01:45:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 440. [2022-07-22 01:45:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 1.3454545454545455) internal successors, (592), 439 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 592 transitions. [2022-07-22 01:45:18,299 INFO L392 hiAutomatonCegarLoop]: Abstraction has 440 states and 592 transitions. [2022-07-22 01:45:18,300 INFO L374 stractBuchiCegarLoop]: Abstraction has 440 states and 592 transitions. [2022-07-22 01:45:18,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 01:45:18,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 592 transitions. [2022-07-22 01:45:18,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 412 [2022-07-22 01:45:18,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:18,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:18,303 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,303 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,303 INFO L752 eck$LassoCheckResult]: Stem: 6916#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 6903#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6889#L59 assume !(0 == mp_add_~a3~0#1 % 256); 6890#L59-1 mp_add_~nb~0#1 := 4; 6911#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 6896#L71 assume !(0 == mp_add_~b2~0#1 % 256); 6897#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6918#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6919#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7263#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7251#L84-2 [2022-07-22 01:45:18,304 INFO L754 eck$LassoCheckResult]: Loop: 7251#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7247#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7243#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7234#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7232#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7230#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7225#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7221#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7222#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7311#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6998#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6999#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7300#L84 assume !(0 == mp_add_~i~0#1 % 256); 7295#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 7023#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6904#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6905#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6895#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6907#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 6901#L96-8 mp_add_~carry~0#1 := 1; 6902#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7307#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6990#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7306#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7303#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6931#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6932#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6891#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6892#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6912#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6899#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6900#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6927#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6951#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7238#L84 assume !(0 == mp_add_~i~0#1 % 256); 7304#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6920#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6921#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 7236#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7202#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 7289#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 7287#L96-8 mp_add_~carry~0#1 := 1; 7286#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7285#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7284#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7283#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6985#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6995#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6996#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7192#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7171#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7012#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7165#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7060#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7058#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7029#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7027#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7025#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7024#L84 assume !(0 == mp_add_~i~0#1 % 256); 7022#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7020#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7018#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7016#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7015#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 7149#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 7148#L96-8 mp_add_~carry~0#1 := 1; 7147#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6989#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6991#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6983#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6984#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6978#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6979#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6973#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6975#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6969#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6970#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6964#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6965#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6959#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6960#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7028#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7256#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7251#L84-2 [2022-07-22 01:45:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 10 times [2022-07-22 01:45:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217790774] [2022-07-22 01:45:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -110068253, now seen corresponding path program 1 times [2022-07-22 01:45:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289519054] [2022-07-22 01:45:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-22 01:45:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:18,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289519054] [2022-07-22 01:45:18,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289519054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:18,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:18,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 01:45:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071244593] [2022-07-22 01:45:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:18,399 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:45:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:45:18,400 INFO L87 Difference]: Start difference. First operand 440 states and 592 transitions. cyclomatic complexity: 155 Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:18,753 INFO L93 Difference]: Finished difference Result 737 states and 972 transitions. [2022-07-22 01:45:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:45:18,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 737 states and 972 transitions. [2022-07-22 01:45:18,758 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 658 [2022-07-22 01:45:18,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 737 states to 735 states and 969 transitions. [2022-07-22 01:45:18,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2022-07-22 01:45:18,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 735 [2022-07-22 01:45:18,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 969 transitions. [2022-07-22 01:45:18,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:18,766 INFO L369 hiAutomatonCegarLoop]: Abstraction has 735 states and 969 transitions. [2022-07-22 01:45:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 969 transitions. [2022-07-22 01:45:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 609. [2022-07-22 01:45:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 609 states have (on average 1.3497536945812807) internal successors, (822), 608 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 822 transitions. [2022-07-22 01:45:18,775 INFO L392 hiAutomatonCegarLoop]: Abstraction has 609 states and 822 transitions. [2022-07-22 01:45:18,775 INFO L374 stractBuchiCegarLoop]: Abstraction has 609 states and 822 transitions. [2022-07-22 01:45:18,776 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 01:45:18,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 609 states and 822 transitions. [2022-07-22 01:45:18,780 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 581 [2022-07-22 01:45:18,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:18,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:18,782 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,782 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:18,782 INFO L752 eck$LassoCheckResult]: Stem: 8118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 8105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 8091#L59 assume !(0 == mp_add_~a3~0#1 % 256); 8092#L59-1 mp_add_~nb~0#1 := 4; 8113#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 8098#L71 assume !(0 == mp_add_~b2~0#1 % 256); 8099#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 8136#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8447#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8445#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8443#L84-2 [2022-07-22 01:45:18,783 INFO L754 eck$LassoCheckResult]: Loop: 8443#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8442#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8440#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8436#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8430#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8432#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8425#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8678#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8676#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8674#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8419#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8418#L84 assume !(0 == mp_add_~i~0#1 % 256); 8417#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 8222#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8415#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8412#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8406#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8408#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8650#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8255#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8649#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8648#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8383#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8384#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8379#L84 assume !(0 == mp_add_~i~0#1 % 256); 8371#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8367#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 8220#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8365#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8361#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8362#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8397#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8395#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8394#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8393#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8392#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8390#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8340#L84 assume !(0 == mp_add_~i~0#1 % 256); 8389#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8388#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8387#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 8386#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8336#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8319#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 8314#L96-8 mp_add_~carry~0#1 := 1; 8310#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8303#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8297#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8293#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8289#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8288#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8284#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8285#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8359#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8396#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8251#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8248#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8230#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8227#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8228#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8448#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8278#L90 assume !(0 == mp_add_~i~0#1 % 256); 8276#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8272#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8273#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8360#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8260#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 8201#L96-8 mp_add_~carry~0#1 := 1; 8202#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8197#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8195#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8192#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8193#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8241#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8239#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8237#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8236#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8235#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8234#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8233#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8232#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8231#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8229#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8224#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8225#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8443#L84-2 [2022-07-22 01:45:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 11 times [2022-07-22 01:45:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457245859] [2022-07-22 01:45:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:18,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1842182454, now seen corresponding path program 1 times [2022-07-22 01:45:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241612136] [2022-07-22 01:45:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 107 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 01:45:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241612136] [2022-07-22 01:45:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241612136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950608811] [2022-07-22 01:45:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:18,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:18,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:18,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 01:45:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:18,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 01:45:18,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 01:45:19,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:19,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950608811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:19,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-22 01:45:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170937936] [2022-07-22 01:45:19,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:19,084 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:45:19,085 INFO L87 Difference]: Start difference. First operand 609 states and 822 transitions. cyclomatic complexity: 217 Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:19,175 INFO L93 Difference]: Finished difference Result 1047 states and 1364 transitions. [2022-07-22 01:45:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:45:19,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1047 states and 1364 transitions. [2022-07-22 01:45:19,182 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 895 [2022-07-22 01:45:19,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1047 states to 1035 states and 1349 transitions. [2022-07-22 01:45:19,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1035 [2022-07-22 01:45:19,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1035 [2022-07-22 01:45:19,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1035 states and 1349 transitions. [2022-07-22 01:45:19,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:19,189 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1035 states and 1349 transitions. [2022-07-22 01:45:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states and 1349 transitions. [2022-07-22 01:45:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 844. [2022-07-22 01:45:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 844 states have (on average 1.3270142180094786) internal successors, (1120), 843 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1120 transitions. [2022-07-22 01:45:19,203 INFO L392 hiAutomatonCegarLoop]: Abstraction has 844 states and 1120 transitions. [2022-07-22 01:45:19,203 INFO L374 stractBuchiCegarLoop]: Abstraction has 844 states and 1120 transitions. [2022-07-22 01:45:19,204 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 01:45:19,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 844 states and 1120 transitions. [2022-07-22 01:45:19,207 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 743 [2022-07-22 01:45:19,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:19,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:19,208 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:19,208 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:19,208 INFO L752 eck$LassoCheckResult]: Stem: 10042#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 10028#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 10014#L59 assume !(0 == mp_add_~a3~0#1 % 256); 10015#L59-1 mp_add_~nb~0#1 := 4; 10037#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 10021#L71 assume !(0 == mp_add_~b2~0#1 % 256); 10022#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 10060#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10357#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 10358#L84-2 [2022-07-22 01:45:19,209 INFO L754 eck$LassoCheckResult]: Loop: 10358#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10353#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 10354#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10769#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10767#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 10766#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10765#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10763#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10759#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10755#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 10751#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10749#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10747#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10745#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10742#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10743#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10738#L84 assume !(0 == mp_add_~i~0#1 % 256); 10737#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 10138#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 10735#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10733#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10730#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10728#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10726#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 10540#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10576#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10577#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10721#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10720#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10566#L84 assume !(0 == mp_add_~i~0#1 % 256); 10565#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10564#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 10214#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10560#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10556#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10554#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10552#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10549#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 10508#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10509#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10504#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10505#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10500#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10494#L90 assume !(0 == mp_add_~i~0#1 % 256); 10497#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10495#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10492#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 10489#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 10486#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 10485#L96-8 mp_add_~carry~0#1 := 1; 10484#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10483#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10482#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10481#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 10113#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10445#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10478#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10479#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10365#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10366#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10341#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10209#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10208#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10150#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10151#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10211#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 10210#L90 assume !(0 == mp_add_~i~0#1 % 256); 10147#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 10149#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 10203#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 10529#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 10524#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 10520#L96-8 mp_add_~carry~0#1 := 1; 10518#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10516#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10114#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10112#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10110#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10111#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10105#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10107#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10101#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 10102#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 10096#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10098#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10090#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10091#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10152#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10153#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10359#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 10358#L84-2 [2022-07-22 01:45:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 12 times [2022-07-22 01:45:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:19,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918534162] [2022-07-22 01:45:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:19,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:19,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash -713828190, now seen corresponding path program 1 times [2022-07-22 01:45:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291891153] [2022-07-22 01:45:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 142 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 01:45:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:19,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291891153] [2022-07-22 01:45:19,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291891153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:19,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984371907] [2022-07-22 01:45:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:19,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:19,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:19,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:19,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 01:45:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:19,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:45:19,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:45:19,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:45:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984371907] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:19,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:19,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-07-22 01:45:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125271067] [2022-07-22 01:45:19,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:19,552 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 01:45:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 01:45:19,553 INFO L87 Difference]: Start difference. First operand 844 states and 1120 transitions. cyclomatic complexity: 281 Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:20,419 INFO L93 Difference]: Finished difference Result 2651 states and 3555 transitions. [2022-07-22 01:45:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 01:45:20,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2651 states and 3555 transitions. [2022-07-22 01:45:20,435 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2057 [2022-07-22 01:45:20,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2651 states to 2589 states and 3469 transitions. [2022-07-22 01:45:20,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2589 [2022-07-22 01:45:20,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2589 [2022-07-22 01:45:20,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2589 states and 3469 transitions. [2022-07-22 01:45:20,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:20,451 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2589 states and 3469 transitions. [2022-07-22 01:45:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states and 3469 transitions. [2022-07-22 01:45:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2114. [2022-07-22 01:45:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2114 states have (on average 1.378902554399243) internal successors, (2915), 2113 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2915 transitions. [2022-07-22 01:45:20,486 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2915 transitions. [2022-07-22 01:45:20,486 INFO L374 stractBuchiCegarLoop]: Abstraction has 2114 states and 2915 transitions. [2022-07-22 01:45:20,486 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 01:45:20,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 2915 transitions. [2022-07-22 01:45:20,495 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-22 01:45:20,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:20,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:20,496 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:20,496 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:20,496 INFO L752 eck$LassoCheckResult]: Stem: 14138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 14123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 14114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 14115#L59-1 mp_add_~nb~0#1 := 4; 14131#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 14118#L71 assume !(0 == mp_add_~b2~0#1 % 256); 14119#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14139#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14140#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14703#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 14704#L84-2 [2022-07-22 01:45:20,496 INFO L754 eck$LassoCheckResult]: Loop: 14704#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 16130#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 16128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 16127#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14698#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 14697#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14696#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14694#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14691#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14684#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14685#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14681#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14680#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14678#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14679#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14673#L84 assume !(0 == mp_add_~i~0#1 % 256); 14671#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 14400#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14667#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14668#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14664#L90 assume !(0 == mp_add_~i~0#1 % 256); 14663#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 14560#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14662#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14655#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14647#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14648#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 14266#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14642#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14634#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14635#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14674#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14672#L84 assume !(0 == mp_add_~i~0#1 % 256); 14608#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14607#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 14398#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14603#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14601#L90 assume !(0 == mp_add_~i~0#1 % 256); 14602#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14590#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 14379#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14584#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14586#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14573#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14574#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 14512#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14513#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14505#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14506#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14481#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14480#L90 assume !(0 == mp_add_~i~0#1 % 256); 14479#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14478#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14477#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 14475#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 14476#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 14529#L96-8 mp_add_~carry~0#1 := 1; 14528#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14527#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14526#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14455#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 14420#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14451#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14449#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14450#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14490#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14540#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14539#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14424#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14423#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14289#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14404#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14405#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14705#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14387#L90 assume !(0 == mp_add_~i~0#1 % 256); 14383#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14384#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14372#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14373#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 14436#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 14433#L96-8 mp_add_~carry~0#1 := 1; 14430#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14431#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14421#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14419#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14418#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14417#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14415#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14413#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14412#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14411#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14410#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14409#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14408#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14407#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14406#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14402#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14403#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 14704#L84-2 [2022-07-22 01:45:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 13 times [2022-07-22 01:45:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:20,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853377280] [2022-07-22 01:45:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:20,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:20,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash 883914334, now seen corresponding path program 1 times [2022-07-22 01:45:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:20,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127668422] [2022-07-22 01:45:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-22 01:45:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127668422] [2022-07-22 01:45:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127668422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:20,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:45:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932273983] [2022-07-22 01:45:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:20,558 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:45:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:45:20,559 INFO L87 Difference]: Start difference. First operand 2114 states and 2915 transitions. cyclomatic complexity: 812 Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:20,585 INFO L93 Difference]: Finished difference Result 2114 states and 2846 transitions. [2022-07-22 01:45:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:45:20,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2114 states and 2846 transitions. [2022-07-22 01:45:20,597 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-22 01:45:20,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2114 states to 2114 states and 2846 transitions. [2022-07-22 01:45:20,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2022-07-22 01:45:20,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2022-07-22 01:45:20,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 2846 transitions. [2022-07-22 01:45:20,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:20,610 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-22 01:45:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 2846 transitions. [2022-07-22 01:45:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2022-07-22 01:45:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2114 states have (on average 1.346263008514664) internal successors, (2846), 2113 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2846 transitions. [2022-07-22 01:45:20,643 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-22 01:45:20,643 INFO L374 stractBuchiCegarLoop]: Abstraction has 2114 states and 2846 transitions. [2022-07-22 01:45:20,643 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 01:45:20,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 2846 transitions. [2022-07-22 01:45:20,664 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1869 [2022-07-22 01:45:20,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:20,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:20,666 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:20,666 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:20,666 INFO L752 eck$LassoCheckResult]: Stem: 18371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 18356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 18347#L59 assume !(0 == mp_add_~a3~0#1 % 256); 18348#L59-1 mp_add_~nb~0#1 := 4; 18365#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 18351#L71 assume !(0 == mp_add_~b2~0#1 % 256); 18352#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18372#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18373#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19062#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 19061#L84-2 [2022-07-22 01:45:20,666 INFO L754 eck$LassoCheckResult]: Loop: 19061#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 19060#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19058#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19059#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19056#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 19055#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19053#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19051#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19047#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19049#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 19042#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19043#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19038#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19039#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19034#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19035#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19029#L84 assume !(0 == mp_add_~i~0#1 % 256); 19027#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 18644#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19025#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19021#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19019#L90 assume !(0 == mp_add_~i~0#1 % 256); 19017#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 18630#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19014#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19012#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19002#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 18499#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18997#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18995#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18991#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18992#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19028#L84 assume !(0 == mp_add_~i~0#1 % 256); 18854#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18853#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 18642#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18849#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18847#L90 assume !(0 == mp_add_~i~0#1 % 256); 18848#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18843#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 18587#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 18839#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18829#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18830#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18791#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 18792#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18785#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18786#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18779#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18725#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18724#L90 assume !(0 == mp_add_~i~0#1 % 256); 18723#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18722#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 18721#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 18719#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18718#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18717#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18716#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18715#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 18714#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18713#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18711#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18708#L84 assume !(0 == mp_add_~i~0#1 % 256); 18709#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18699#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18700#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18689#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18688#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18674#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18669#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18670#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18653#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18526#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18649#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18650#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18645#L84 assume !(0 == mp_add_~i~0#1 % 256); 18643#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18641#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18639#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18636#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18620#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18677#L96 assume !(0 == mp_add_~partial_sum~0#1); 18681#L96-2 assume !false; 18680#L96-4 assume !false; 18679#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 18678#L96-8 mp_add_~carry~0#1 := 1; 18675#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18671#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18673#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18665#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18664#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18663#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18661#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18659#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18658#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18657#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18656#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18654#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18652#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18651#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18648#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18646#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18647#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 19061#L84-2 [2022-07-22 01:45:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 14 times [2022-07-22 01:45:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:20,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080143599] [2022-07-22 01:45:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:20,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:20,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -845879228, now seen corresponding path program 1 times [2022-07-22 01:45:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:20,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087033471] [2022-07-22 01:45:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 7 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-22 01:45:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087033471] [2022-07-22 01:45:20,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087033471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332747862] [2022-07-22 01:45:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:20,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:20,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:20,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:20,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 01:45:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:20,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:45:20,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 01:45:21,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 177 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 01:45:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332747862] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:21,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:21,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-07-22 01:45:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828715540] [2022-07-22 01:45:21,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:21,159 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:21,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 01:45:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 01:45:21,160 INFO L87 Difference]: Start difference. First operand 2114 states and 2846 transitions. cyclomatic complexity: 743 Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:21,392 INFO L93 Difference]: Finished difference Result 1202 states and 1506 transitions. [2022-07-22 01:45:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:21,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1202 states and 1506 transitions. [2022-07-22 01:45:21,398 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 784 [2022-07-22 01:45:21,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1202 states to 942 states and 1246 transitions. [2022-07-22 01:45:21,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 942 [2022-07-22 01:45:21,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 942 [2022-07-22 01:45:21,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 942 states and 1246 transitions. [2022-07-22 01:45:21,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:21,404 INFO L369 hiAutomatonCegarLoop]: Abstraction has 942 states and 1246 transitions. [2022-07-22 01:45:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states and 1246 transitions. [2022-07-22 01:45:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 652. [2022-07-22 01:45:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 652 states have (on average 1.3236196319018405) internal successors, (863), 651 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-22 01:45:21,414 INFO L392 hiAutomatonCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-22 01:45:21,414 INFO L374 stractBuchiCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-22 01:45:21,414 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 01:45:21,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 652 states and 863 transitions. [2022-07-22 01:45:21,416 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-22 01:45:21,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:21,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:21,417 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:21,417 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:21,417 INFO L752 eck$LassoCheckResult]: Stem: 22325#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 22315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 22303#L59 assume !(0 == mp_add_~a3~0#1 % 256); 22304#L59-1 mp_add_~nb~0#1 := 4; 22320#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 22310#L71 assume !(0 == mp_add_~b2~0#1 % 256); 22311#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 22392#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22390#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22388#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 22386#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22385#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22383#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22380#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22376#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22377#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 22372#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22373#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22368#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22369#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22365#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22339#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22323#L84 assume !(0 == mp_add_~i~0#1 % 256); 22324#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 22329#L85-1 [2022-07-22 01:45:21,417 INFO L754 eck$LassoCheckResult]: Loop: 22329#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22316#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22317#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22829#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22953#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22952#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 22403#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22951#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22950#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22949#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22948#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22947#L84 assume !(0 == mp_add_~i~0#1 % 256); 22946#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22931#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 22577#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 22930#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22926#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22925#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22924#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22698#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 22401#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 22696#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22697#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22940#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22938#L84 assume !(0 == mp_add_~i~0#1 % 256); 22936#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 22934#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 22933#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 22343#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 22305#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 22306#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22321#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22313#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22314#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 22334#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22337#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22358#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 22927#L84 assume !(0 == mp_add_~i~0#1 % 256); 22922#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 22329#L85-1 [2022-07-22 01:45:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 19635510, now seen corresponding path program 1 times [2022-07-22 01:45:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833077669] [2022-07-22 01:45:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833077669] [2022-07-22 01:45:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833077669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:21,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:21,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:45:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991573086] [2022-07-22 01:45:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:21,479 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1205102556, now seen corresponding path program 1 times [2022-07-22 01:45:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:21,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113810982] [2022-07-22 01:45:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113810982] [2022-07-22 01:45:21,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113810982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361926947] [2022-07-22 01:45:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:21,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:21,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:21,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 01:45:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:21,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:21,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 01:45:21,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:21,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361926947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:21,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:21,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-22 01:45:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901006817] [2022-07-22 01:45:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:21,625 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:45:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:45:21,625 INFO L87 Difference]: Start difference. First operand 652 states and 863 transitions. cyclomatic complexity: 219 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:21,858 INFO L93 Difference]: Finished difference Result 1898 states and 2521 transitions. [2022-07-22 01:45:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:45:21,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1898 states and 2521 transitions. [2022-07-22 01:45:21,865 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 1683 [2022-07-22 01:45:21,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1898 states to 1898 states and 2521 transitions. [2022-07-22 01:45:21,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1898 [2022-07-22 01:45:21,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1898 [2022-07-22 01:45:21,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1898 states and 2521 transitions. [2022-07-22 01:45:21,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:21,876 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1898 states and 2521 transitions. [2022-07-22 01:45:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states and 2521 transitions. [2022-07-22 01:45:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 652. [2022-07-22 01:45:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 652 states have (on average 1.3236196319018405) internal successors, (863), 651 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 863 transitions. [2022-07-22 01:45:21,890 INFO L392 hiAutomatonCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-22 01:45:21,890 INFO L374 stractBuchiCegarLoop]: Abstraction has 652 states and 863 transitions. [2022-07-22 01:45:21,891 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-22 01:45:21,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 652 states and 863 transitions. [2022-07-22 01:45:21,892 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-22 01:45:21,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:21,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:21,893 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:21,893 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:21,893 INFO L752 eck$LassoCheckResult]: Stem: 25009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 24997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 24990#L59 assume !(0 == mp_add_~a3~0#1 % 256); 24991#L59-1 mp_add_~nb~0#1 := 4; 25002#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 24994#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 24996#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 25028#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 25074#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25073#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25072#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 25071#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25070#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25069#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25066#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25068#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25346#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 25345#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25344#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25343#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25342#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25056#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25057#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25491#L84 assume !(0 == mp_add_~i~0#1 % 256); 25024#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 25025#L85-1 [2022-07-22 01:45:21,893 INFO L754 eck$LassoCheckResult]: Loop: 25025#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25490#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25541#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25452#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25536#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25534#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 25089#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25489#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25488#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25486#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25485#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25484#L84 assume !(0 == mp_add_~i~0#1 % 256); 25471#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25470#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 25106#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25469#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25468#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25465#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 25086#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25464#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25367#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25366#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25365#L84 assume !(0 == mp_add_~i~0#1 % 256); 25364#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25363#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25362#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 25361#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25360#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25358#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25356#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25354#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25352#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 25156#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25044#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 25045#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25176#L84 assume !(0 == mp_add_~i~0#1 % 256); 25174#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 25025#L85-1 [2022-07-22 01:45:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1233837692, now seen corresponding path program 1 times [2022-07-22 01:45:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:21,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041871007] [2022-07-22 01:45:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:21,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041871007] [2022-07-22 01:45:21,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041871007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:21,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:21,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 01:45:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849596027] [2022-07-22 01:45:21,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:21,965 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1205102556, now seen corresponding path program 2 times [2022-07-22 01:45:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:21,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005540461] [2022-07-22 01:45:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:22,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005540461] [2022-07-22 01:45:22,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005540461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:22,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943391411] [2022-07-22 01:45:22,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:45:22,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:22,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:22,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:22,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 01:45:22,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 01:45:22,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:45:22,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:22,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 01:45:22,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943391411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:22,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:22,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-22 01:45:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768204584] [2022-07-22 01:45:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:22,101 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:45:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:45:22,102 INFO L87 Difference]: Start difference. First operand 652 states and 863 transitions. cyclomatic complexity: 219 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:22,553 INFO L93 Difference]: Finished difference Result 2515 states and 3342 transitions. [2022-07-22 01:45:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:45:22,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2515 states and 3342 transitions. [2022-07-22 01:45:22,562 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 2244 [2022-07-22 01:45:22,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2515 states to 2515 states and 3342 transitions. [2022-07-22 01:45:22,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2515 [2022-07-22 01:45:22,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2515 [2022-07-22 01:45:22,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2515 states and 3342 transitions. [2022-07-22 01:45:22,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:22,575 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2515 states and 3342 transitions. [2022-07-22 01:45:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states and 3342 transitions. [2022-07-22 01:45:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 634. [2022-07-22 01:45:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.3296529968454258) internal successors, (843), 633 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 843 transitions. [2022-07-22 01:45:22,592 INFO L392 hiAutomatonCegarLoop]: Abstraction has 634 states and 843 transitions. [2022-07-22 01:45:22,592 INFO L374 stractBuchiCegarLoop]: Abstraction has 634 states and 843 transitions. [2022-07-22 01:45:22,592 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-22 01:45:22,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 843 transitions. [2022-07-22 01:45:22,593 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 561 [2022-07-22 01:45:22,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:22,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:22,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:22,594 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:22,594 INFO L752 eck$LassoCheckResult]: Stem: 28312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 28303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 28290#L59 assume !(0 == mp_add_~a3~0#1 % 256); 28291#L59-1 mp_add_~nb~0#1 := 4; 28308#L69 assume !(0 == mp_add_~b3~0#1 % 256); 28299#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 28315#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28316#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28373#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 28372#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28371#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28370#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28369#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28368#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 28367#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28366#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28365#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28364#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28363#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 28362#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28361#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28360#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28359#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28357#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28358#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28660#L84 assume !(0 == mp_add_~i~0#1 % 256); 28658#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 28410#L85-1 [2022-07-22 01:45:22,594 INFO L754 eck$LassoCheckResult]: Loop: 28410#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28656#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28917#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28651#L90 assume !(0 == mp_add_~i~0#1 % 256); 28649#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 28432#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28647#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28646#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28645#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28644#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 28421#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28643#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28641#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28659#L84 assume !(0 == mp_add_~i~0#1 % 256); 28657#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28587#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 28408#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28585#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28579#L90 assume !(0 == mp_add_~i~0#1 % 256); 28575#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28555#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 28429#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28554#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28553#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28552#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28539#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28419#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28537#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28516#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28513#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28515#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28565#L90 assume !(0 == mp_add_~i~0#1 % 256); 28564#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28563#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28562#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 28561#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28490#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28491#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28485#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 28478#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28479#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28472#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28473#L84 assume !(0 == mp_add_~i~0#1 % 256); 28463#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 28410#L85-1 [2022-07-22 01:45:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-22 01:45:22,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:22,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915972926] [2022-07-22 01:45:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:22,618 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:22,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1630170944, now seen corresponding path program 1 times [2022-07-22 01:45:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:22,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096874042] [2022-07-22 01:45:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096874042] [2022-07-22 01:45:22,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096874042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:22,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714496375] [2022-07-22 01:45:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:22,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:22,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:22,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 01:45:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:22,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:22,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 01:45:22,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:22,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714496375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:22,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:22,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-22 01:45:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721139463] [2022-07-22 01:45:22,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:22,751 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:45:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 01:45:22,751 INFO L87 Difference]: Start difference. First operand 634 states and 843 transitions. cyclomatic complexity: 217 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:22,857 INFO L93 Difference]: Finished difference Result 639 states and 752 transitions. [2022-07-22 01:45:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:45:22,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 752 transitions. [2022-07-22 01:45:22,859 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 522 [2022-07-22 01:45:22,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 554 states and 638 transitions. [2022-07-22 01:45:22,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2022-07-22 01:45:22,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 554 [2022-07-22 01:45:22,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 554 states and 638 transitions. [2022-07-22 01:45:22,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:22,862 INFO L369 hiAutomatonCegarLoop]: Abstraction has 554 states and 638 transitions. [2022-07-22 01:45:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 638 transitions. [2022-07-22 01:45:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 491. [2022-07-22 01:45:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 491 states have (on average 1.1690427698574337) internal successors, (574), 490 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 574 transitions. [2022-07-22 01:45:22,869 INFO L392 hiAutomatonCegarLoop]: Abstraction has 491 states and 574 transitions. [2022-07-22 01:45:22,869 INFO L374 stractBuchiCegarLoop]: Abstraction has 491 states and 574 transitions. [2022-07-22 01:45:22,869 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-22 01:45:22,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 491 states and 574 transitions. [2022-07-22 01:45:22,870 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 459 [2022-07-22 01:45:22,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:22,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:22,871 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:22,871 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:22,871 INFO L752 eck$LassoCheckResult]: Stem: 29734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 29724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29712#L59 assume !(0 == mp_add_~a3~0#1 % 256); 29713#L59-1 mp_add_~nb~0#1 := 4; 29729#L69 assume !(0 == mp_add_~b3~0#1 % 256); 29720#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 29746#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29917#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29916#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29915#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29914#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29913#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29912#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29911#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 29910#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29909#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29908#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29907#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29906#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 29905#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29904#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29903#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29902#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29901#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29899#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29898#L84 assume !(0 == mp_add_~i~0#1 % 256); 29897#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 29805#L85-1 [2022-07-22 01:45:22,871 INFO L754 eck$LassoCheckResult]: Loop: 29805#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29896#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29894#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29893#L90 assume !(0 == mp_add_~i~0#1 % 256); 29892#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 29797#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29891#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29890#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29888#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29819#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29887#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29886#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29885#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29882#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29881#L84 assume !(0 == mp_add_~i~0#1 % 256); 29880#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29879#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 29803#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29875#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29873#L90 assume !(0 == mp_add_~i~0#1 % 256); 29871#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29868#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 29795#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29864#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29862#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29860#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29857#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 29816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29855#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29852#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29853#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29884#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29963#L90 assume !(0 == mp_add_~i~0#1 % 256); 29962#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29961#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29960#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 29867#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29959#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29954#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29953#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29942#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 29941#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29939#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29936#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29833#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29933#L90 assume !(0 == mp_add_~i~0#1 % 256); 29931#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29928#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29925#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29923#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29922#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29920#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29921#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29870#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29856#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29854#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29850#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29851#L84 assume !(0 == mp_add_~i~0#1 % 256); 29846#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 29805#L85-1 [2022-07-22 01:45:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-22 01:45:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:22,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317705357] [2022-07-22 01:45:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:22,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:22,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1536835773, now seen corresponding path program 2 times [2022-07-22 01:45:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:22,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246144998] [2022-07-22 01:45:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:22,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246144998] [2022-07-22 01:45:22,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246144998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:22,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168784684] [2022-07-22 01:45:22,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:45:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:22,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:22,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 01:45:22,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 01:45:22,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:45:23,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:45:23,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 01:45:23,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:23,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168784684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:23,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2022-07-22 01:45:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798034770] [2022-07-22 01:45:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:23,349 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:45:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 01:45:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-22 01:45:23,350 INFO L87 Difference]: Start difference. First operand 491 states and 574 transitions. cyclomatic complexity: 90 Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:23,621 INFO L93 Difference]: Finished difference Result 429 states and 450 transitions. [2022-07-22 01:45:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 01:45:23,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 450 transitions. [2022-07-22 01:45:23,626 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 108 [2022-07-22 01:45:23,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 417 states and 432 transitions. [2022-07-22 01:45:23,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2022-07-22 01:45:23,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2022-07-22 01:45:23,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 432 transitions. [2022-07-22 01:45:23,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:23,629 INFO L369 hiAutomatonCegarLoop]: Abstraction has 417 states and 432 transitions. [2022-07-22 01:45:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 432 transitions. [2022-07-22 01:45:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 212. [2022-07-22 01:45:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 1.0566037735849056) internal successors, (224), 211 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2022-07-22 01:45:23,633 INFO L392 hiAutomatonCegarLoop]: Abstraction has 212 states and 224 transitions. [2022-07-22 01:45:23,633 INFO L374 stractBuchiCegarLoop]: Abstraction has 212 states and 224 transitions. [2022-07-22 01:45:23,633 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-22 01:45:23,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 224 transitions. [2022-07-22 01:45:23,633 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2022-07-22 01:45:23,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:23,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:23,634 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:23,634 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:23,634 INFO L752 eck$LassoCheckResult]: Stem: 30847#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 30840#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 30833#L59 assume !(0 == mp_add_~a3~0#1 % 256); 30834#L59-1 mp_add_~nb~0#1 := 4; 30843#L69 assume !(0 == mp_add_~b3~0#1 % 256); 30838#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 30858#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30911#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30910#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 30909#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30908#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30907#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30906#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30905#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 30904#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 30903#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 30902#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 30901#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30900#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 30899#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30898#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30897#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30896#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30895#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30893#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30892#L84 assume !(0 == mp_add_~i~0#1 % 256); 30891#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 30890#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30888#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30885#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30881#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30882#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30877#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 30878#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30873#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30874#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30869#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30870#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30864#L84 assume !(0 == mp_add_~i~0#1 % 256); 30865#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30860#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 30861#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30932#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30929#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30928#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30927#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30926#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 30925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30923#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30922#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30921#L84 assume !(0 == mp_add_~i~0#1 % 256); 30920#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30919#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30917#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 30918#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30992#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31039#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31038#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31037#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30852#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 30853#L102-1 [2022-07-22 01:45:23,635 INFO L754 eck$LassoCheckResult]: Loop: 30853#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30913#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30912#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30845#L84 assume !(0 == mp_add_~i~0#1 % 256); 30846#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30850#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30851#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30859#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30828#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 30829#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30844#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30835#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30836#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30853#L102-1 [2022-07-22 01:45:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1922539841, now seen corresponding path program 1 times [2022-07-22 01:45:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:23,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468195468] [2022-07-22 01:45:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 01:45:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468195468] [2022-07-22 01:45:23,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468195468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736194145] [2022-07-22 01:45:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:23,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:23,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 01:45:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:23,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:23,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 01:45:23,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 01:45:24,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736194145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:24,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:24,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-07-22 01:45:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103113943] [2022-07-22 01:45:24,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:24,059 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 1 times [2022-07-22 01:45:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:24,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006968511] [2022-07-22 01:45:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:24,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:24,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:24,157 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:24,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:24,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:24,158 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:24,158 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:24,158 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:24,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:24,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:24,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2022-07-22 01:45:24,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:24,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:24,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:24,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:24,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:24,409 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:24,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:24,415 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:24,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:45:24,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:24,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:24,445 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:45:24,445 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:45:24,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:24,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:24,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:24,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:24,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:24,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:24,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:45:24,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:24,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:24,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:24,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:45:24,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:24,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:25,230 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:25,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 01:45:25,234 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:25,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:25,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:25,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:25,235 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:25,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:25,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:25,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration22_Loop [2022-07-22 01:45:25,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:25,236 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:25,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-22 01:45:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:25,497 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:25,501 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:25,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:25,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:25,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:45:25,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,580 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:45:25,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:25,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:25,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,640 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,642 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,658 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:25,661 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:25,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 01:45:25,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,696 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,714 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:25,719 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:25,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:45:25,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,766 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,768 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,786 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:25,791 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:25,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:45:25,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:45:25,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,854 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:25,859 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:25,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,902 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:25,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,903 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:45:25,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,914 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:25,917 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:25,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:25,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:25,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:25,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:25,957 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:25,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:45:25,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:25,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:25,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:25,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:25,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:25,967 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:25,973 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:25,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,033 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,035 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:45:26,050 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,050 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:26,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,051 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:26,053 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:26,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,095 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:45:26,108 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,108 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:26,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,109 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:26,113 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:26,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,154 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-22 01:45:26,154 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:26,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,156 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,173 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,173 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:26,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,174 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:26,177 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:26,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:45:26,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,217 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,227 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,227 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:26,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,227 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:26,234 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:26,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:45:26,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,281 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,282 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,295 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,295 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:26,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,295 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:26,300 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:26,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:45:26,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 01:45:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,327 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 01:45:26,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,339 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,339 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:26,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,339 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:26,349 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:26,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,396 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:26,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,397 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 01:45:26,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,404 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,405 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:26,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,405 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:26,407 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:26,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,429 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 01:45:26,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,440 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,440 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:26,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,440 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:26,444 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:26,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,489 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,491 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,503 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,503 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:26,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,503 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:26,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:26,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 01:45:26,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:26,555 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:26,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:26,573 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:26,573 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:26,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:26,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:26,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:26,574 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:26,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:26,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:26,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 01:45:26,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:26,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 01:45:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2022-07-22 01:45:26,630 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. cyclomatic complexity: 16 Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:26,947 INFO L93 Difference]: Finished difference Result 442 states and 461 transitions. [2022-07-22 01:45:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 01:45:26,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 461 transitions. [2022-07-22 01:45:26,950 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 132 [2022-07-22 01:45:26,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 442 states and 461 transitions. [2022-07-22 01:45:26,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2022-07-22 01:45:26,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2022-07-22 01:45:26,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 461 transitions. [2022-07-22 01:45:26,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:26,952 INFO L369 hiAutomatonCegarLoop]: Abstraction has 442 states and 461 transitions. [2022-07-22 01:45:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 461 transitions. [2022-07-22 01:45:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 296. [2022-07-22 01:45:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 296 states have (on average 1.054054054054054) internal successors, (312), 295 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 312 transitions. [2022-07-22 01:45:26,957 INFO L392 hiAutomatonCegarLoop]: Abstraction has 296 states and 312 transitions. [2022-07-22 01:45:26,957 INFO L374 stractBuchiCegarLoop]: Abstraction has 296 states and 312 transitions. [2022-07-22 01:45:26,957 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-22 01:45:26,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 312 transitions. [2022-07-22 01:45:26,957 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2022-07-22 01:45:26,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:26,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:26,958 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:26,958 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:26,958 INFO L752 eck$LassoCheckResult]: Stem: 31884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 31876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31869#L59 assume !(0 == mp_add_~a3~0#1 % 256); 31870#L59-1 mp_add_~nb~0#1 := 4; 31879#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31881#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 32001#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32002#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31997#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 31998#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31993#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31994#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31989#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31990#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 31985#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31986#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31981#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31982#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31977#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31978#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31973#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31974#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31969#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31970#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31965#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31931#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32056#L90 assume !(0 == mp_add_~i~0#1 % 256); 32054#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 32052#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32050#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32046#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32044#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32043#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32042#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32041#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32040#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32031#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32030#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32029#L90 assume !(0 == mp_add_~i~0#1 % 256); 32028#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32027#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 32026#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32025#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32024#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32023#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32022#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32021#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32020#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32019#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32018#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32017#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32016#L90 assume !(0 == mp_add_~i~0#1 % 256); 32015#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32014#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32013#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 32012#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32011#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32010#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32009#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32008#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 32006#L102-1 [2022-07-22 01:45:26,958 INFO L754 eck$LassoCheckResult]: Loop: 32006#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31886#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31887#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31893#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32058#L90 assume !(0 == mp_add_~i~0#1 % 256); 32057#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32055#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32053#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32051#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32049#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32047#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32045#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32007#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32006#L102-1 [2022-07-22 01:45:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash -70625049, now seen corresponding path program 1 times [2022-07-22 01:45:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:26,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348315079] [2022-07-22 01:45:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 01:45:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:27,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348315079] [2022-07-22 01:45:27,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348315079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:27,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810669661] [2022-07-22 01:45:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:27,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:27,045 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-22 01:45:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:27,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:45:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 01:45:27,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 01:45:27,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810669661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:27,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:27,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-07-22 01:45:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068078] [2022-07-22 01:45:27,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:27,392 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 1 times [2022-07-22 01:45:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466085426] [2022-07-22 01:45:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:27,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:27,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:27,477 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:27,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:27,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:27,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:27,478 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:27,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:27,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:27,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:27,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2022-07-22 01:45:27,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:27,478 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:27,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:27,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:27,676 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:27,676 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:27,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:27,679 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 01:45:27,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:27,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:27,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:45:27,696 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:45:27,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 01:45:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:27,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:27,712 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:27,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 01:45:27,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:27,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:27,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 01:45:27,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:27,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:27,759 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:27,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 01:45:27,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:27,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:28,404 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:28,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 01:45:28,409 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:28,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:28,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:28,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:28,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:28,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:28,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:28,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration23_Loop [2022-07-22 01:45:28,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:28,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:28,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:28,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:28,586 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:28,586 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,588 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 01:45:28,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:28,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:28,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,617 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-22 01:45:28,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,618 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:28,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:28,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 01:45:28,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:28,675 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,676 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 01:45:28,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,685 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:28,687 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:28,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,707 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-22 01:45:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,709 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 01:45:28,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,716 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:28,720 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:28,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,738 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-22 01:45:28,738 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:28,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,740 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 01:45:28,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,750 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:28,752 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:28,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 01:45:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,771 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:45:28,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,779 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:28,786 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:28,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:28,821 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,823 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,835 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:28,837 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:28,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:45:28,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:28,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,872 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 01:45:28,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:28,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,880 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:28,885 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:28,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 01:45:28,907 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:28,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,908 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 01:45:28,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,916 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:28,916 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:28,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,917 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:28,918 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:28,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 01:45:28,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,937 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 01:45:28,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,945 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:28,945 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:28,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,945 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:28,948 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:28,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,967 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-22 01:45:28,967 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:28,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:28,969 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:28,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 01:45:28,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:28,976 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:28,976 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:28,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:28,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:28,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:28,976 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:28,979 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:28,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:28,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:28,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:28,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:28,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,000 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 01:45:29,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,008 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,008 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:29,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,008 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:29,013 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:29,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 01:45:29,039 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:29,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,041 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 01:45:29,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,049 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,049 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:29,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,049 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:29,058 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:29,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:45:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,083 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 01:45:29,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,091 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,091 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:29,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,092 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:29,098 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:29,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 01:45:29,146 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:29,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,148 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 01:45:29,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,154 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,155 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:29,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,155 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:29,157 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:29,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:29,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,216 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,226 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,226 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:29,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,226 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:29,231 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:29,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 01:45:29,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:29,267 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,268 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,278 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,278 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:29,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,278 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:29,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:29,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 01:45:29,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:29,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:29,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,347 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:29,362 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:29,363 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:29,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:29,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:29,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:29,363 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:29,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:29,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:29,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 01:45:29,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:29,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 01:45:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 01:45:29,412 INFO L87 Difference]: Start difference. First operand 296 states and 312 transitions. cyclomatic complexity: 20 Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:29,596 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2022-07-22 01:45:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:29,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 268 transitions. [2022-07-22 01:45:29,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2022-07-22 01:45:29,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 248 states and 257 transitions. [2022-07-22 01:45:29,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2022-07-22 01:45:29,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2022-07-22 01:45:29,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 257 transitions. [2022-07-22 01:45:29,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:29,600 INFO L369 hiAutomatonCegarLoop]: Abstraction has 248 states and 257 transitions. [2022-07-22 01:45:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 257 transitions. [2022-07-22 01:45:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2022-07-22 01:45:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.0379746835443038) internal successors, (246), 236 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 246 transitions. [2022-07-22 01:45:29,603 INFO L392 hiAutomatonCegarLoop]: Abstraction has 237 states and 246 transitions. [2022-07-22 01:45:29,603 INFO L374 stractBuchiCegarLoop]: Abstraction has 237 states and 246 transitions. [2022-07-22 01:45:29,603 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-22 01:45:29,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 246 transitions. [2022-07-22 01:45:29,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-22 01:45:29,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:29,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:29,604 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:29,604 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:29,605 INFO L752 eck$LassoCheckResult]: Stem: 32819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 32811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 32804#L59 assume !(0 == mp_add_~a3~0#1 % 256); 32805#L59-1 mp_add_~nb~0#1 := 4; 32814#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32808#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32810#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32830#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 32940#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32939#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32938#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 32937#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32936#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32935#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32934#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32933#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 32932#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32931#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32930#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32929#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32928#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 32927#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32926#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32924#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32923#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32922#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32921#L84 assume !(0 == mp_add_~i~0#1 % 256); 32920#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 32919#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32918#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32916#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32915#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32914#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32913#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32912#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32911#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32910#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32909#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32908#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32907#L84 assume !(0 == mp_add_~i~0#1 % 256); 32906#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32904#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 32812#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32813#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32832#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33015#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33014#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33013#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32960#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32959#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32957#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32956#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32954#L84 assume !(0 == mp_add_~i~0#1 % 256); 32953#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32950#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 32947#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32946#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32945#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32944#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32943#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32942#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 32827#L102-1 [2022-07-22 01:45:29,605 INFO L754 eck$LassoCheckResult]: Loop: 32827#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32820#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32821#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32817#L84 assume !(0 == mp_add_~i~0#1 % 256); 32818#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32828#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32905#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32968#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32966#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32964#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32963#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32962#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32941#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32827#L102-1 [2022-07-22 01:45:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1569068628, now seen corresponding path program 1 times [2022-07-22 01:45:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364852373] [2022-07-22 01:45:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:29,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:29,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 2 times [2022-07-22 01:45:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:29,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556231773] [2022-07-22 01:45:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:29,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:29,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1058244261, now seen corresponding path program 2 times [2022-07-22 01:45:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:29,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009456858] [2022-07-22 01:45:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:29,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009456858] [2022-07-22 01:45:29,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009456858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:29,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262680732] [2022-07-22 01:45:29,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:45:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:29,749 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:29,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-07-22 01:45:29,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 01:45:29,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:45:29,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 01:45:29,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 01:45:30,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-22 01:45:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262680732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:30,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:30,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-07-22 01:45:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488382087] [2022-07-22 01:45:30,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:30,381 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:30,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:30,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:30,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:30,381 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:30,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:30,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:30,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:30,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2022-07-22 01:45:30,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:30,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:30,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:30,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:30,601 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:30,601 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:30,604 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:30,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:30,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:30,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 01:45:30,630 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:45:30,630 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:45:30,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:30,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:30,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:30,654 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:30,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 01:45:30,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:30,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:30,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 01:45:30,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:30,722 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 01:45:30,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:30,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:31,795 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:31,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:31,800 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:31,800 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:31,800 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:31,800 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:31,800 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:31,800 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:31,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:31,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:31,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration24_Loop [2022-07-22 01:45:31,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:31,800 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:31,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:31,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:31,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:31,997 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:31,999 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:31,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 01:45:32,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:32,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:32,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 01:45:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,024 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 01:45:32,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:32,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:32,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 01:45:32,051 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:32,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,052 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 01:45:32,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,060 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:32,061 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:32,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 01:45:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,079 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 01:45:32,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,087 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:32,089 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:32,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 01:45:32,107 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,108 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 01:45:32,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,116 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,118 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 01:45:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,136 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 01:45:32,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,144 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,147 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-22 01:45:32,166 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,167 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 01:45:32,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,175 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:32,178 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:32,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 01:45:32,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,199 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 01:45:32,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-22 01:45:32,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:32,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,208 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:32,212 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:32,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 01:45:32,232 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,233 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 01:45:32,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,241 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,241 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:32,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,241 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:32,243 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:32,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 01:45:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,280 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 01:45:32,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,286 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,287 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:32,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,287 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:32,292 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:32,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 01:45:32,336 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:32,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,338 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 01:45:32,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,347 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,347 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:32,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,348 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,350 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,390 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,402 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:32,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,403 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 01:45:32,409 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 01:45:32,435 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:32,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,436 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 01:45:32,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,443 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,444 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:32,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,444 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:32,447 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:32,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,470 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 01:45:32,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,477 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,477 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:32,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,478 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:32,484 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:32,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,537 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,539 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,550 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,550 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:32,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,550 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,552 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 01:45:32,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,586 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,598 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,598 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:32,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,598 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:32,602 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:32,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 01:45:32,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,638 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:32,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,639 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,650 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,650 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:32,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,651 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:32,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:32,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 01:45:32,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:32,695 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:32,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:32,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:32,707 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:32,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:32,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:32,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:32,708 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:32,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:32,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:32,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 01:45:32,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:32,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 01:45:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-22 01:45:32,761 INFO L87 Difference]: Start difference. First operand 237 states and 246 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:33,307 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2022-07-22 01:45:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:45:33,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 241 transitions. [2022-07-22 01:45:33,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:33,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 202 states and 205 transitions. [2022-07-22 01:45:33,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2022-07-22 01:45:33,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2022-07-22 01:45:33,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 205 transitions. [2022-07-22 01:45:33,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:33,309 INFO L369 hiAutomatonCegarLoop]: Abstraction has 202 states and 205 transitions. [2022-07-22 01:45:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 205 transitions. [2022-07-22 01:45:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 88. [2022-07-22 01:45:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2022-07-22 01:45:33,311 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-22 01:45:33,311 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 91 transitions. [2022-07-22 01:45:33,311 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-22 01:45:33,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 91 transitions. [2022-07-22 01:45:33,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:33,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:33,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:33,313 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:33,313 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:33,313 INFO L752 eck$LassoCheckResult]: Stem: 33778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 33771#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 33760#L59 assume !(0 == mp_add_~a3~0#1 % 256); 33761#L59-1 mp_add_~nb~0#1 := 4; 33774#L69 assume !(0 == mp_add_~b3~0#1 % 256); 33767#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 33787#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33839#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33776#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 33777#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33824#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33823#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33822#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33821#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 33820#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33819#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33818#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33817#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33816#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33815#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33814#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33813#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33812#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33811#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33810#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33809#L84 assume !(0 == mp_add_~i~0#1 % 256); 33808#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33807#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33806#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33805#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33804#L90 assume !(0 == mp_add_~i~0#1 % 256); 33803#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 33802#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33801#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33800#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33799#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33798#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 33797#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33796#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33795#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33794#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33793#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33792#L84 assume !(0 == mp_add_~i~0#1 % 256); 33791#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33789#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 33790#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33838#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33837#L90 assume !(0 == mp_add_~i~0#1 % 256); 33836#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33835#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 33834#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33833#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33832#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33831#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33830#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33829#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33828#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33827#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33826#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33825#L84 assume !(0 == mp_add_~i~0#1 % 256); 33788#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33781#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33772#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 33773#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33847#L90 assume !(0 == mp_add_~i~0#1 % 256); 33846#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33845#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33844#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 33843#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33842#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33841#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33840#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33782#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33783#L102-1 [2022-07-22 01:45:33,313 INFO L754 eck$LassoCheckResult]: Loop: 33783#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33779#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33780#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 33786#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33784#L90 assume !(0 == mp_add_~i~0#1 % 256); 33785#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33762#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33763#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33764#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33765#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33775#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33769#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33770#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33783#L102-1 [2022-07-22 01:45:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash -740058285, now seen corresponding path program 1 times [2022-07-22 01:45:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22344899] [2022-07-22 01:45:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:33,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:33,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 2 times [2022-07-22 01:45:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:33,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949936660] [2022-07-22 01:45:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:33,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:33,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1373885214, now seen corresponding path program 1 times [2022-07-22 01:45:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532880602] [2022-07-22 01:45:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 36 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532880602] [2022-07-22 01:45:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532880602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679395576] [2022-07-22 01:45:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:33,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:33,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:33,477 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:33,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-07-22 01:45:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:33,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 01:45:33,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 01:45:33,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 36 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-22 01:45:34,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679395576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:34,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:34,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2022-07-22 01:45:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603847305] [2022-07-22 01:45:34,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:34,146 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:34,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:34,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:34,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:34,146 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:34,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:34,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:34,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:34,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-07-22 01:45:34,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:34,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:34,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:34,338 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:34,338 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:34,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:34,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:34,340 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:34,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 01:45:34,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:34,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:34,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 01:45:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:34,399 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:34,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 01:45:34,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:34,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:35,286 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:35,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 01:45:35,291 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:35,291 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:35,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:35,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:35,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:35,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:35,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:35,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-07-22 01:45:35,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:35,291 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:35,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:35,482 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:35,483 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,484 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 01:45:35,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:35,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:35,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 01:45:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,513 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 01:45:35,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:35,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:35,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 01:45:35,541 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,542 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 01:45:35,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,550 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:35,551 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:35,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 01:45:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,570 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 01:45:35,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-22 01:45:35,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,577 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:35,580 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:35,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 01:45:35,598 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,599 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 01:45:35,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,607 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:35,611 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:35,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:35,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,653 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,667 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:35,671 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:35,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 01:45:35,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:35,700 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:35,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,702 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 01:45:35,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,710 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:35,716 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:35,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-22 01:45:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,740 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 01:45:35,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:35,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,748 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:35,753 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:35,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-22 01:45:35,773 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,774 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 01:45:35,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,783 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:35,784 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:35,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,784 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:35,792 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:35,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,829 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 01:45:35,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,839 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:35,839 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:35,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,840 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:35,843 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:35,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 01:45:35,879 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:35,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,880 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 01:45:35,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,888 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:35,889 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:35,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,889 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:35,891 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:35,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 01:45:35,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,923 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 01:45:35,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,931 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:35,931 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:35,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,931 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:35,935 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:35,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-22 01:45:35,959 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,960 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 01:45:35,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:35,968 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:35,968 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:35,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:35,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:35,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:35,968 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:35,971 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:35,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:35,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:35,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 01:45:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:35,994 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:35,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 01:45:35,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:36,002 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:36,002 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:36,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:36,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:36,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:36,002 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:36,011 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:36,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:36,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:36,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-22 01:45:36,045 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:36,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:36,047 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:36,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-22 01:45:36,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:36,054 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:36,054 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:36,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:36,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:36,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:36,054 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:36,056 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:36,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:36,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:36,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-22 01:45:36,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:36,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:36,076 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:36,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-22 01:45:36,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-22 01:45:36,083 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:36,084 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:36,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:36,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:36,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:36,084 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:36,087 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:36,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:36,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:36,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:36,108 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:36,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:36,109 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:36,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-22 01:45:36,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:36,116 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:36,117 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:36,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:36,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:36,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:36,117 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:36,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:36,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:36,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:36,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 01:45:36,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:36,141 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:36,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 01:45:36,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:36,149 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:36,149 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:36,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:36,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:36,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:36,150 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:36,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:36,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:36,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:36,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 01:45:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-22 01:45:36,179 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:37,206 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2022-07-22 01:45:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 01:45:37,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 234 transitions. [2022-07-22 01:45:37,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:37,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 89 states and 90 transitions. [2022-07-22 01:45:37,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-07-22 01:45:37,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-07-22 01:45:37,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 90 transitions. [2022-07-22 01:45:37,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:37,208 INFO L369 hiAutomatonCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-22 01:45:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 90 transitions. [2022-07-22 01:45:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-22 01:45:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0113636363636365) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-22 01:45:37,210 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-22 01:45:37,210 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-22 01:45:37,210 INFO L287 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-07-22 01:45:37,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 89 transitions. [2022-07-22 01:45:37,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:37,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:37,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:37,212 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:37,212 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:37,212 INFO L752 eck$LassoCheckResult]: Stem: 34666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34653#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34654#L59-1 mp_add_~nb~0#1 := 4; 34662#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34657#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34658#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 34676#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34677#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34716#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34664#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34665#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34713#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34712#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34711#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34710#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 34709#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34708#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34707#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34706#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34705#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34704#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34703#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34702#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34701#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34700#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34699#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34698#L84 assume !(0 == mp_add_~i~0#1 % 256); 34697#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34696#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34695#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34694#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34693#L90 assume !(0 == mp_add_~i~0#1 % 256); 34692#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 34691#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34690#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34688#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34687#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34686#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34685#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34683#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34682#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34681#L84 assume !(0 == mp_add_~i~0#1 % 256); 34680#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34678#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 34679#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34728#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34727#L90 assume !(0 == mp_add_~i~0#1 % 256); 34726#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34725#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 34724#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34723#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34722#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34721#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34720#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34719#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34718#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34717#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34715#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34714#L84 assume !(0 == mp_add_~i~0#1 % 256); 34675#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34669#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34660#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 34661#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34733#L90 assume !(0 == mp_add_~i~0#1 % 256); 34732#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34731#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34729#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 34730#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34736#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34735#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34734#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34670#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34671#L102-1 [2022-07-22 01:45:37,212 INFO L754 eck$LassoCheckResult]: Loop: 34671#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34667#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34668#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 34674#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34672#L90 assume !(0 == mp_add_~i~0#1 % 256); 34673#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34649#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34650#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34651#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34652#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34663#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34655#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34656#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34671#L102-1 [2022-07-22 01:45:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -597058712, now seen corresponding path program 1 times [2022-07-22 01:45:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987482814] [2022-07-22 01:45:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 01:45:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987482814] [2022-07-22 01:45:37,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987482814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844740731] [2022-07-22 01:45:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:37,406 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:37,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-07-22 01:45:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:37,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:45:37,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 01:45:37,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:45:37,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844740731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:37,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:45:37,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-22 01:45:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199604926] [2022-07-22 01:45:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:37,965 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 3 times [2022-07-22 01:45:37,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:37,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331235447] [2022-07-22 01:45:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:37,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:37,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:38,046 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:38,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:38,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:38,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:38,046 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:38,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:38,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:38,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:38,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-07-22 01:45:38,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:38,046 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:38,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:38,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:38,228 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:38,228 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:38,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:38,231 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:38,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 01:45:38,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:38,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:38,244 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:45:38,245 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:45:38,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-22 01:45:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:38,261 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:38,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 01:45:38,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:38,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:38,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:38,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:38,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:38,351 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:38,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:38,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:38,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 01:45:39,784 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:39,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-22 01:45:39,788 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:39,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:39,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:39,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:39,788 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:39,788 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:39,788 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:39,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:39,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-07-22 01:45:39,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:39,789 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:39,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:39,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:39,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:39,941 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:39,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:39,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:39,943 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:39,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 01:45:39,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:39,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:39,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:39,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:39,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:39,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:39,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:39,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:39,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:39,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-22 01:45:39,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:39,969 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:39,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 01:45:39,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:39,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:39,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:39,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:39,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:39,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:39,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:39,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:39,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:39,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-22 01:45:39,995 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:39,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:39,996 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:39,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 01:45:39,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,005 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:40,006 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:40,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:40,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,032 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 01:45:40,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,040 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:40,043 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:40,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 01:45:40,061 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:40,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,062 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 01:45:40,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,070 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,071 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-22 01:45:40,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,090 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-22 01:45:40,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,098 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,101 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-22 01:45:40,121 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:40,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,122 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-22 01:45:40,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,129 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:40,132 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:40,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:40,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,154 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-22 01:45:40,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:40,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,163 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:40,167 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:40,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 01:45:40,187 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:40,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,188 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-22 01:45:40,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,195 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,195 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:40,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,195 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:40,197 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:40,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-22 01:45:40,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,224 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-22 01:45:40,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,231 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,231 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:40,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,231 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:40,234 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:40,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-22 01:45:40,254 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,255 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-22 01:45:40,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-22 01:45:40,262 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,263 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:40,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,263 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,265 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:40,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,288 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-22 01:45:40,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,296 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,296 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:40,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,296 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,300 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-22 01:45:40,326 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:40,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,328 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,339 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,339 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:40,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,339 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:40,342 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:40,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-22 01:45:40,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-22 01:45:40,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,373 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-22 01:45:40,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,380 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,381 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:40,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,381 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:40,389 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:40,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-22 01:45:40,416 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:40,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,417 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-22 01:45:40,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,425 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,425 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:40,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,425 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,427 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-22 01:45:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,447 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-22 01:45:40,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,454 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,454 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:40,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,454 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:40,457 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:40,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:40,478 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:40,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,479 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-22 01:45:40,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,486 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,486 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:40,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,487 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:40,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:40,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-22 01:45:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,511 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-22 01:45:40,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:40,518 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:40,519 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:40,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:40,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:40,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:40,519 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:40,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:40,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:40,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:40,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-22 01:45:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:45:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-07-22 01:45:40,548 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:40,592 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2022-07-22 01:45:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 01:45:40,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 147 transitions. [2022-07-22 01:45:40,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:40,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 88 states and 88 transitions. [2022-07-22 01:45:40,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-07-22 01:45:40,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-07-22 01:45:40,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 88 transitions. [2022-07-22 01:45:40,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:40,595 INFO L369 hiAutomatonCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-22 01:45:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 88 transitions. [2022-07-22 01:45:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-22 01:45:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0) internal successors, (88), 87 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2022-07-22 01:45:40,596 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-22 01:45:40,596 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 88 transitions. [2022-07-22 01:45:40,597 INFO L287 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-07-22 01:45:40,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 88 transitions. [2022-07-22 01:45:40,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:45:40,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:40,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:40,598 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:40,598 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:40,598 INFO L752 eck$LassoCheckResult]: Stem: 35141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 35134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 35128#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35129#L59-1 mp_add_~nb~0#1 := 4; 35137#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35132#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35133#L73 assume !(0 == mp_add_~b1~0#1 % 256); 35151#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35142#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35143#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35139#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 35140#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35187#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35186#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35185#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35184#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 35183#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35182#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35181#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35180#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35179#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35178#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35177#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35176#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35173#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35172#L84 assume !(0 == mp_add_~i~0#1 % 256); 35171#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 35170#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35168#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35167#L90 assume !(0 == mp_add_~i~0#1 % 256); 35166#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 35165#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35164#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35163#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35162#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35161#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35160#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35159#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35158#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35157#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35156#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35155#L84 assume !(0 == mp_add_~i~0#1 % 256); 35154#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35153#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 35135#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35136#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35148#L90 assume !(0 == mp_add_~i~0#1 % 256); 35149#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35209#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 35208#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35207#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35205#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35203#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35190#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35191#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35197#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35195#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35193#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35189#L84 assume !(0 == mp_add_~i~0#1 % 256); 35150#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35144#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35145#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35211#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35210#L90 assume !(0 == mp_add_~i~0#1 % 256); 35152#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35124#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35125#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 35126#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35127#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35138#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35130#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35131#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35146#L102-1 [2022-07-22 01:45:40,598 INFO L754 eck$LassoCheckResult]: Loop: 35146#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35147#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35206#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 35204#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35202#L90 assume !(0 == mp_add_~i~0#1 % 256); 35201#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35200#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35199#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35198#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35196#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35194#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35192#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35188#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35146#L102-1 [2022-07-22 01:45:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1089684886, now seen corresponding path program 1 times [2022-07-22 01:45:40,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:40,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422918884] [2022-07-22 01:45:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 55 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 01:45:40,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:40,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422918884] [2022-07-22 01:45:40,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422918884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:40,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882229670] [2022-07-22 01:45:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:40,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:40,744 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:40,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-07-22 01:45:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:40,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 01:45:40,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 01:45:41,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 01:45:42,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882229670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:42,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:42,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 20 [2022-07-22 01:45:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475873831] [2022-07-22 01:45:42,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:42,083 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 922833652, now seen corresponding path program 4 times [2022-07-22 01:45:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:42,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652526734] [2022-07-22 01:45:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:42,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:42,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:42,178 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:42,178 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:42,178 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:42,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:42,179 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:45:42,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:42,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:42,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:42,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-07-22 01:45:42,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:42,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:42,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:42,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:42,336 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:42,336 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:45:42,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:42,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:42,337 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:42,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-22 01:45:42,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:42,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:42,351 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:45:42,351 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:45:42,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-22 01:45:42,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:42,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:42,368 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:42,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-22 01:45:42,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:45:42,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:42,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-22 01:45:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:42,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:42,409 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:42,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-22 01:45:42,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:45:42,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:45:42,950 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:45:42,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:42,954 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:42,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:42,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:42,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:42,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:42,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:42,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:42,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:42,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-07-22 01:45:42,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:42,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:42,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:42,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:43,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:43,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,136 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-22 01:45:43,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:43,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:43,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-22 01:45:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,162 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-22 01:45:43,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:43,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:45:43,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-22 01:45:43,188 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-22 01:45:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,190 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-22 01:45:43,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,198 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:43,199 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:43,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-22 01:45:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,218 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-22 01:45:43,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,226 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:43,229 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:43,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-07-22 01:45:43,247 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-22 01:45:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,249 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-22 01:45:43,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,257 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,258 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-22 01:45:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,277 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-22 01:45:43,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,285 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,288 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-22 01:45:43,306 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-22 01:45:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,308 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-22 01:45:43,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,315 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:43,318 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:43,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-22 01:45:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,337 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 01:45:43,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:43,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,345 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:43,349 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:43,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-22 01:45:43,369 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-22 01:45:43,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,370 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 01:45:43,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,376 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,376 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:43,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,377 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:43,378 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:43,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:43,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,397 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 01:45:43,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,404 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,404 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:43,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,404 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-22 01:45:43,408 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-22 01:45:43,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-07-22 01:45:43,436 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-22 01:45:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,437 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 01:45:43,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,445 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,445 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:43,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,446 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,447 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-07-22 01:45:43,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,468 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 01:45:43,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,476 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,476 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-22 01:45:43,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,476 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,480 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-22 01:45:43,504 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-22 01:45:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,505 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 01:45:43,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,515 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,515 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:43,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,516 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:43,518 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:43,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,542 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 01:45:43,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,551 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,551 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:43,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,551 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-22 01:45:43,556 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-22 01:45:43,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-07-22 01:45:43,588 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-22 01:45:43,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,589 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 01:45:43,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,597 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,597 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:43,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,598 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,599 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-22 01:45:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,618 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 01:45:43,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,626 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,626 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-22 01:45:43,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,626 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-22 01:45:43,630 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 01:45:43,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:43,651 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-22 01:45:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,652 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 01:45:43,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,659 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,660 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:43,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,660 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:43,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:43,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-22 01:45:43,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:43,684 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:43,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 01:45:43,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:43,692 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-22 01:45:43,692 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-22 01:45:43,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:45:43,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:43,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:45:43,692 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-22 01:45:43,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:45:43,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:45:43,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:45:43,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-22 01:45:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:43,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 01:45:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-22 01:45:43,721 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. cyclomatic complexity: 1 Second operand has 20 states, 20 states have (on average 8.15) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:45:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:43,815 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2022-07-22 01:45:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 01:45:43,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 48 transitions. [2022-07-22 01:45:43,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:45:43,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2022-07-22 01:45:43,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:45:43,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:45:43,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:45:43,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:43,816 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:43,817 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:43,817 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:43,817 INFO L287 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-07-22 01:45:43,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:45:43,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:45:43,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:45:43,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:45:43 BoogieIcfgContainer [2022-07-22 01:45:43,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:45:43,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:45:43,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:45:43,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:45:43,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:12" (3/4) ... [2022-07-22 01:45:43,825 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:45:43,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:45:43,826 INFO L158 Benchmark]: Toolchain (without parser) took 32030.64ms. Allocated memory was 52.4MB in the beginning and 255.9MB in the end (delta: 203.4MB). Free memory was 29.0MB in the beginning and 107.3MB in the end (delta: -78.2MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,826 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:43,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.55ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.9MB in the beginning and 51.5MB in the end (delta: -22.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.45ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 43.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,827 INFO L158 Benchmark]: Boogie Preprocessor took 80.36ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 38.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,827 INFO L158 Benchmark]: RCFGBuilder took 654.79ms. Allocated memory is still 69.2MB. Free memory was 38.6MB in the beginning and 40.1MB in the end (delta: -1.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,827 INFO L158 Benchmark]: BuchiAutomizer took 30890.36ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 39.8MB in the beginning and 107.3MB in the end (delta: -67.5MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2022-07-22 01:45:43,828 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 255.9MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:43,829 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.55ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.9MB in the beginning and 51.5MB in the end (delta: -22.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.45ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 43.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.36ms. Allocated memory is still 69.2MB. Free memory was 43.2MB in the beginning and 38.8MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 654.79ms. Allocated memory is still 69.2MB. Free memory was 38.6MB in the beginning and 40.1MB in the end (delta: -1.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 30890.36ms. Allocated memory was 69.2MB in the beginning and 255.9MB in the end (delta: 186.6MB). Free memory was 39.8MB in the beginning and 107.3MB in the end (delta: -67.5MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 255.9MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.8s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 22.6s. Construction of modules took 4.7s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 5882 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4135 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4135 mSDsluCounter, 3824 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 285 IncrementalHoareTripleChecker+Unchecked, 2554 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6324 IncrementalHoareTripleChecker+Invalid, 7245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 1270 mSDtfsCounter, 6324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI17 SFLT0 conc2 concLT0 SILN0 SILU4 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div387 bol100 ite100 ukn100 eq146 hnf96 smp34 dnf100 smp100 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 37ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 01:45:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:44,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-07-22 01:45:44,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-07-22 01:45:44,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-07-22 01:45:44,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:44,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 01:45:45,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:45,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 01:45:45,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-22 01:45:45,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 01:45:45,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:46,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 01:45:46,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:46,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 01:45:46,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:46,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:47,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE