./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1bee8f90a51995308bcbd8ad4799b8f1188ad74 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:58:27,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:58:27,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:58:27,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:58:27,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:58:27,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:58:27,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:58:27,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:58:27,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:58:27,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:58:27,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:58:27,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:58:27,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:58:27,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:58:27,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:58:27,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:58:27,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:58:27,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:58:27,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:58:27,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:58:27,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:58:27,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:58:27,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:58:27,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:58:27,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:58:27,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:58:27,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:58:27,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:58:27,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:58:27,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:58:27,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:58:27,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:58:27,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:58:27,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:58:27,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:58:27,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:58:27,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:58:27,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:58:27,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:58:27,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:58:27,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:58:27,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:58:27,889 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:58:27,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:58:27,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:58:27,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:58:27,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:58:27,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:58:27,894 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:58:27,894 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:58:27,894 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:58:27,894 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:58:27,895 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:58:27,895 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:58:27,896 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:58:27,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:58:27,896 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:58:27,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:58:27,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:58:27,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:58:27,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:58:27,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:58:27,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:58:27,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:58:27,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:58:27,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:58:27,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:58:27,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:58:27,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:58:27,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:58:27,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:58:27,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:58:27,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:58:27,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:58:27,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:58:27,912 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 -> a1bee8f90a51995308bcbd8ad4799b8f1188ad74 [2021-08-31 04:58:28,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:58:28,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:58:28,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:58:28,305 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:58:28,306 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:58:28,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-08-31 04:58:28,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662c40bc4/1e2113c424064f34a4e566b1a4602665/FLAG58f9c662b [2021-08-31 04:58:28,890 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:58:28,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-08-31 04:58:28,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662c40bc4/1e2113c424064f34a4e566b1a4602665/FLAG58f9c662b [2021-08-31 04:58:29,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662c40bc4/1e2113c424064f34a4e566b1a4602665 [2021-08-31 04:58:29,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:58:29,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:58:29,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:58:29,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:58:29,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:58:29,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744ed33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29, skipping insertion in model container [2021-08-31 04:58:29,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:58:29,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:58:29,566 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c[20187,20200] [2021-08-31 04:58:29,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:58:29,588 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:58:29,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c[20187,20200] [2021-08-31 04:58:29,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:58:29,713 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:58:29,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29 WrapperNode [2021-08-31 04:58:29,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:58:29,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:58:29,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:58:29,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:58:29,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:58:29,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:58:29,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:58:29,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:58:29,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:58:29,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:58:29,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:58:29,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:58:29,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (1/1) ... [2021-08-31 04:58:29,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:29,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:29,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 04:58:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:58:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:58:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:58:29,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:58:30,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:58:30,390 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-31 04:58:30,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:58:30 BoogieIcfgContainer [2021-08-31 04:58:30,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:58:30,394 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:58:30,397 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:58:30,400 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:58:30,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:30,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:58:29" (1/3) ... [2021-08-31 04:58:30,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@252f09f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:58:30, skipping insertion in model container [2021-08-31 04:58:30,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:30,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:58:29" (2/3) ... [2021-08-31 04:58:30,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@252f09f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:58:30, skipping insertion in model container [2021-08-31 04:58:30,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:58:30,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:58:30" (3/3) ... [2021-08-31 04:58:30,404 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2021-08-31 04:58:30,453 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:58:30,454 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:58:30,454 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:58:30,454 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:58:30,454 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:58:30,454 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:58:30,454 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:58:30,454 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:58:30,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:30,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-08-31 04:58:30,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:30,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:30,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:30,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:30,503 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:58:30,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:30,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-08-31 04:58:30,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:30,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:30,513 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:30,513 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:30,520 INFO L791 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 40#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 60#L264true assume !(0 == ~r1~0);init_~tmp~0 := 0; 83#L264-1true init_#res := init_~tmp~0; 124#L465true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 41#L22true assume !(0 == assume_abort_if_not_~cond); 98#L21true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 31#L549-2true [2021-08-31 04:58:30,525 INFO L793 eck$LassoCheckResult]: Loop: 31#L549-2true assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 37#L85true assume !(0 != ~mode1~0 % 256); 113#L101true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 86#L101-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 7#L85-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 106#L113true assume !(0 != ~mode2~0 % 256); 72#L126true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 125#L126-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 47#L113-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 64#L138true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 44#L141true assume !(node3_~m3~0 != ~nomsg~0); 109#L141-1true ~mode3~0 := 0; 92#L138-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 52#L163true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 93#L166true assume !(node4_~m4~0 != ~nomsg~0); 79#L166-1true ~mode4~0 := 0; 48#L163-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 18#L188true assume !(0 != ~mode5~0 % 256); 65#L201true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite11 := ~p5_new~0; 107#L201-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 10#L188-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 117#L213true assume !(0 != ~mode6~0 % 256); 12#L226true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 39#L226-2true ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 15#L213-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 25#L238true assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 30#L241true assume !(node7_~m7~0 != ~nomsg~0); 126#L241-1true ~mode7~0 := 0; 97#L238-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 116#L473true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 91#L473-1true check_#res := check_~tmp~1; 17#L493true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 75#L585true assume !(0 == assert_~arg % 256); 4#L580true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 31#L549-2true [2021-08-31 04:58:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2021-08-31 04:58:30,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:30,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69692587] [2021-08-31 04:58:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:30,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:30,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:30,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69692587] [2021-08-31 04:58:30,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69692587] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:30,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:30,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:30,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138714924] [2021-08-31 04:58:30,873 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:58:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1218792358, now seen corresponding path program 1 times [2021-08-31 04:58:30,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:30,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871752925] [2021-08-31 04:58:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:30,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:31,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:31,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871752925] [2021-08-31 04:58:31,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871752925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:31,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:31,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:31,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648034192] [2021-08-31 04:58:31,035 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:31,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:58:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:58:31,066 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:31,700 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2021-08-31 04:58:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:58:31,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2021-08-31 04:58:31,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:58:31,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2021-08-31 04:58:31,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-08-31 04:58:31,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-08-31 04:58:31,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2021-08-31 04:58:31,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:31,719 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-31 04:58:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2021-08-31 04:58:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-31 04:58:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2021-08-31 04:58:31,750 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-31 04:58:31,750 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-31 04:58:31,750 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:58:31,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2021-08-31 04:58:31,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:58:31,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:31,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:31,754 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:31,754 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:31,755 INFO L791 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 340#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 341#L264 assume 0 == ~r1~0; 365#L265 assume ~id1~0 >= 0; 296#L266 assume 0 == ~st1~0; 297#L267 assume ~send1~0 == ~id1~0; 309#L268 assume 0 == ~mode1~0 % 256; 310#L269 assume ~id2~0 >= 0; 290#L270 assume 0 == ~st2~0; 291#L271 assume ~send2~0 == ~id2~0; 332#L272 assume 0 == ~mode2~0 % 256; 344#L273 assume ~id3~0 >= 0; 363#L274 assume 0 == ~st3~0; 388#L275 assume ~send3~0 == ~id3~0; 277#L276 assume 0 == ~mode3~0 % 256; 278#L277 assume ~id4~0 >= 0; 396#L278 assume 0 == ~st4~0; 359#L279 assume ~send4~0 == ~id4~0; 360#L280 assume 0 == ~mode4~0 % 256; 300#L281 assume ~id5~0 >= 0; 279#L282 assume 0 == ~st5~0; 280#L283 assume ~send5~0 == ~id5~0; 366#L284 assume 0 == ~mode5~0 % 256; 367#L285 assume ~id6~0 >= 0; 386#L286 assume 0 == ~st6~0; 372#L287 assume ~send6~0 == ~id6~0; 320#L288 assume 0 == ~mode6~0 % 256; 321#L289 assume ~id7~0 >= 0; 334#L290 assume 0 == ~st7~0; 379#L291 assume ~send7~0 == ~id7~0; 380#L292 assume 0 == ~mode7~0 % 256; 389#L293 assume ~id1~0 != ~id2~0; 394#L294 assume ~id1~0 != ~id3~0; 283#L295 assume ~id1~0 != ~id4~0; 284#L296 assume ~id1~0 != ~id5~0; 333#L297 assume ~id1~0 != ~id6~0; 329#L298 assume ~id1~0 != ~id7~0; 330#L299 assume ~id2~0 != ~id3~0; 339#L300 assume ~id2~0 != ~id4~0; 373#L301 assume ~id2~0 != ~id5~0; 383#L302 assume ~id2~0 != ~id6~0; 384#L303 assume ~id2~0 != ~id7~0; 392#L304 assume ~id3~0 != ~id4~0; 368#L305 assume ~id3~0 != ~id5~0; 369#L306 assume ~id3~0 != ~id6~0; 378#L307 assume ~id3~0 != ~id7~0; 292#L308 assume ~id4~0 != ~id5~0; 293#L309 assume ~id4~0 != ~id6~0; 377#L310 assume ~id4~0 != ~id7~0; 353#L311 assume ~id5~0 != ~id6~0; 354#L312 assume ~id5~0 != ~id7~0; 316#L313 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 317#L264-1 init_#res := init_~tmp~0; 385#L465 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 342#L22 assume !(0 == assume_abort_if_not_~cond); 343#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 276#L549-2 [2021-08-31 04:58:31,755 INFO L793 eck$LassoCheckResult]: Loop: 276#L549-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 331#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 337#L89 assume !(node1_~m1~0 != ~nomsg~0); 336#L89-1 ~mode1~0 := 0; 281#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 282#L113 assume !(0 != ~mode2~0 % 256); 374#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 375#L126-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 350#L113-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 351#L138 assume !(0 != ~mode3~0 % 256); 370#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 314#L151-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 315#L138-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 357#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 358#L166 assume !(node4_~m4~0 != ~nomsg~0); 307#L166-1 ~mode4~0 := 0; 352#L163-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 303#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 304#L191 assume !(node5_~m5~0 != ~nomsg~0); 381#L191-1 ~mode5~0 := 0; 288#L188-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 289#L213 assume !(0 != ~mode6~0 % 256); 294#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 295#L226-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 298#L213-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 299#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 318#L241 assume !(node7_~m7~0 != ~nomsg~0); 323#L241-1 ~mode7~0 := 0; 356#L238-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 391#L473 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 325#L473-1 check_#res := check_~tmp~1; 301#L493 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 302#L585 assume !(0 == assert_~arg % 256); 275#L580 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 276#L549-2 [2021-08-31 04:58:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2021-08-31 04:58:31,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:31,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677945137] [2021-08-31 04:58:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:31,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:31,799 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:31,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash -596530906, now seen corresponding path program 1 times [2021-08-31 04:58:31,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:31,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540777855] [2021-08-31 04:58:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:31,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:32,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:32,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540777855] [2021-08-31 04:58:32,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540777855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:32,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:32,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:58:32,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015056943] [2021-08-31 04:58:32,025 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:32,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:58:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:58:32,026 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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) [2021-08-31 04:58:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:32,472 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2021-08-31 04:58:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:58:32,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2021-08-31 04:58:32,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:58:32,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2021-08-31 04:58:32,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-08-31 04:58:32,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-08-31 04:58:32,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2021-08-31 04:58:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:32,479 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-31 04:58:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2021-08-31 04:58:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-31 04:58:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2021-08-31 04:58:32,493 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-31 04:58:32,493 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-31 04:58:32,494 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:58:32,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2021-08-31 04:58:32,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-31 04:58:32,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:32,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:32,498 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:32,501 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:32,501 INFO L791 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 598#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 599#L264 assume 0 == ~r1~0; 624#L265 assume ~id1~0 >= 0; 555#L266 assume 0 == ~st1~0; 556#L267 assume ~send1~0 == ~id1~0; 568#L268 assume 0 == ~mode1~0 % 256; 569#L269 assume ~id2~0 >= 0; 549#L270 assume 0 == ~st2~0; 550#L271 assume ~send2~0 == ~id2~0; 590#L272 assume 0 == ~mode2~0 % 256; 602#L273 assume ~id3~0 >= 0; 621#L274 assume 0 == ~st3~0; 647#L275 assume ~send3~0 == ~id3~0; 536#L276 assume 0 == ~mode3~0 % 256; 537#L277 assume ~id4~0 >= 0; 655#L278 assume 0 == ~st4~0; 617#L279 assume ~send4~0 == ~id4~0; 618#L280 assume 0 == ~mode4~0 % 256; 559#L281 assume ~id5~0 >= 0; 538#L282 assume 0 == ~st5~0; 539#L283 assume ~send5~0 == ~id5~0; 625#L284 assume 0 == ~mode5~0 % 256; 626#L285 assume ~id6~0 >= 0; 645#L286 assume 0 == ~st6~0; 631#L287 assume ~send6~0 == ~id6~0; 579#L288 assume 0 == ~mode6~0 % 256; 580#L289 assume ~id7~0 >= 0; 592#L290 assume 0 == ~st7~0; 638#L291 assume ~send7~0 == ~id7~0; 639#L292 assume 0 == ~mode7~0 % 256; 648#L293 assume ~id1~0 != ~id2~0; 653#L294 assume ~id1~0 != ~id3~0; 542#L295 assume ~id1~0 != ~id4~0; 543#L296 assume ~id1~0 != ~id5~0; 591#L297 assume ~id1~0 != ~id6~0; 587#L298 assume ~id1~0 != ~id7~0; 588#L299 assume ~id2~0 != ~id3~0; 597#L300 assume ~id2~0 != ~id4~0; 632#L301 assume ~id2~0 != ~id5~0; 642#L302 assume ~id2~0 != ~id6~0; 643#L303 assume ~id2~0 != ~id7~0; 651#L304 assume ~id3~0 != ~id4~0; 627#L305 assume ~id3~0 != ~id5~0; 628#L306 assume ~id3~0 != ~id6~0; 637#L307 assume ~id3~0 != ~id7~0; 551#L308 assume ~id4~0 != ~id5~0; 552#L309 assume ~id4~0 != ~id6~0; 636#L310 assume ~id4~0 != ~id7~0; 611#L311 assume ~id5~0 != ~id6~0; 612#L312 assume ~id5~0 != ~id7~0; 575#L313 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 576#L264-1 init_#res := init_~tmp~0; 644#L465 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 600#L22 assume !(0 == assume_abort_if_not_~cond); 601#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 535#L549-2 [2021-08-31 04:58:32,502 INFO L793 eck$LassoCheckResult]: Loop: 535#L549-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 589#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 595#L89 assume !(node1_~m1~0 != ~nomsg~0); 594#L89-1 ~mode1~0 := 0; 540#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 541#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 585#L116 assume !(node2_~m2~0 != ~nomsg~0); 545#L116-1 ~mode2~0 := 0; 608#L113-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 609#L138 assume !(0 != ~mode3~0 % 256); 629#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 573#L151-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 574#L138-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 615#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 616#L166 assume !(node4_~m4~0 != ~nomsg~0); 566#L166-1 ~mode4~0 := 0; 610#L163-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 562#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 563#L191 assume !(node5_~m5~0 != ~nomsg~0); 640#L191-1 ~mode5~0 := 0; 547#L188-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 548#L213 assume !(0 != ~mode6~0 % 256); 553#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 554#L226-2 ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 557#L213-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 558#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 577#L241 assume !(node7_~m7~0 != ~nomsg~0); 582#L241-1 ~mode7~0 := 0; 614#L238-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 650#L473 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 619#L474 assume ~r1~0 >= 7; 584#L478 assume ~r1~0 < 7;check_~tmp~1 := 1; 623#L473-1 check_#res := check_~tmp~1; 560#L493 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 561#L585 assume !(0 == assert_~arg % 256); 534#L580 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 535#L549-2 [2021-08-31 04:58:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2021-08-31 04:58:32,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:32,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915919981] [2021-08-31 04:58:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:32,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:32,547 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:32,600 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash 395379104, now seen corresponding path program 1 times [2021-08-31 04:58:32,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:32,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909371021] [2021-08-31 04:58:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:32,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:32,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:32,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909371021] [2021-08-31 04:58:32,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909371021] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:32,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:32,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:58:32,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92224237] [2021-08-31 04:58:32,662 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:58:32,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:58:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:58:32,662 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:32,980 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2021-08-31 04:58:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:58:32,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2021-08-31 04:58:32,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-08-31 04:58:32,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2021-08-31 04:58:32,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2021-08-31 04:58:32,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2021-08-31 04:58:32,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2021-08-31 04:58:33,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:33,002 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-31 04:58:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2021-08-31 04:58:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-08-31 04:58:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2021-08-31 04:58:33,013 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-31 04:58:33,013 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-31 04:58:33,013 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:58:33,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2021-08-31 04:58:33,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-08-31 04:58:33,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:58:33,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:58:33,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:33,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:58:33,017 INFO L791 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 909#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 910#L264 assume 0 == ~r1~0; 936#L265 assume ~id1~0 >= 0; 867#L266 assume 0 == ~st1~0; 868#L267 assume ~send1~0 == ~id1~0; 881#L268 assume 0 == ~mode1~0 % 256; 882#L269 assume ~id2~0 >= 0; 859#L270 assume 0 == ~st2~0; 860#L271 assume ~send2~0 == ~id2~0; 900#L272 assume 0 == ~mode2~0 % 256; 913#L273 assume ~id3~0 >= 0; 933#L274 assume 0 == ~st3~0; 959#L275 assume ~send3~0 == ~id3~0; 846#L276 assume 0 == ~mode3~0 % 256; 847#L277 assume ~id4~0 >= 0; 968#L278 assume 0 == ~st4~0; 928#L279 assume ~send4~0 == ~id4~0; 929#L280 assume 0 == ~mode4~0 % 256; 869#L281 assume ~id5~0 >= 0; 848#L282 assume 0 == ~st5~0; 849#L283 assume ~send5~0 == ~id5~0; 937#L284 assume 0 == ~mode5~0 % 256; 938#L285 assume ~id6~0 >= 0; 957#L286 assume 0 == ~st6~0; 943#L287 assume ~send6~0 == ~id6~0; 889#L288 assume 0 == ~mode6~0 % 256; 890#L289 assume ~id7~0 >= 0; 902#L290 assume 0 == ~st7~0; 950#L291 assume ~send7~0 == ~id7~0; 951#L292 assume 0 == ~mode7~0 % 256; 960#L293 assume ~id1~0 != ~id2~0; 966#L294 assume ~id1~0 != ~id3~0; 852#L295 assume ~id1~0 != ~id4~0; 853#L296 assume ~id1~0 != ~id5~0; 901#L297 assume ~id1~0 != ~id6~0; 898#L298 assume ~id1~0 != ~id7~0; 899#L299 assume ~id2~0 != ~id3~0; 907#L300 assume ~id2~0 != ~id4~0; 944#L301 assume ~id2~0 != ~id5~0; 954#L302 assume ~id2~0 != ~id6~0; 955#L303 assume ~id2~0 != ~id7~0; 964#L304 assume ~id3~0 != ~id4~0; 939#L305 assume ~id3~0 != ~id5~0; 940#L306 assume ~id3~0 != ~id6~0; 949#L307 assume ~id3~0 != ~id7~0; 863#L308 assume ~id4~0 != ~id5~0; 864#L309 assume ~id4~0 != ~id6~0; 948#L310 assume ~id4~0 != ~id7~0; 922#L311 assume ~id5~0 != ~id6~0; 923#L312 assume ~id5~0 != ~id7~0; 885#L313 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 886#L264-1 init_#res := init_~tmp~0; 956#L465 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 911#L22 assume !(0 == assume_abort_if_not_~cond); 912#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 845#L549-2 [2021-08-31 04:58:33,017 INFO L793 eck$LassoCheckResult]: Loop: 845#L549-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 897#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 905#L89 assume !(node1_~m1~0 != ~nomsg~0); 904#L89-1 ~mode1~0 := 0; 850#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 851#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 896#L116 assume !(node2_~m2~0 != ~nomsg~0); 855#L116-1 ~mode2~0 := 0; 919#L113-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 920#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 916#L141 assume !(node3_~m3~0 != ~nomsg~0); 917#L141-1 ~mode3~0 := 0; 884#L138-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 926#L163 assume !(0 != ~mode4~0 % 256); 914#L176 assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite10 := ~p4_new~0; 915#L176-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 921#L163-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 872#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 873#L191 assume !(node5_~m5~0 != ~nomsg~0); 952#L191-1 ~mode5~0 := 0; 857#L188-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 858#L213 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 965#L216 assume !(node6_~m6~0 != ~nomsg~0); 880#L216-1 ~mode6~0 := 0; 908#L213-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 978#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 977#L241 assume !(node7_~m7~0 != ~nomsg~0); 973#L241-1 ~mode7~0 := 0; 971#L238-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 970#L473 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 969#L474 assume !(~r1~0 >= 7); 893#L477 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 894#L478 assume ~r1~0 < 7;check_~tmp~1 := 1; 961#L473-1 check_#res := check_~tmp~1; 870#L493 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 871#L585 assume !(0 == assert_~arg % 256); 844#L580 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 845#L549-2 [2021-08-31 04:58:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2021-08-31 04:58:33,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:33,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532855158] [2021-08-31 04:58:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:33,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:33,048 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:33,083 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash -874268515, now seen corresponding path program 1 times [2021-08-31 04:58:33,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:33,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092156436] [2021-08-31 04:58:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:33,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:33,097 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:58:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:58:33,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:58:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1767963948, now seen corresponding path program 1 times [2021-08-31 04:58:33,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:58:33,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088499867] [2021-08-31 04:58:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:58:33,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:58:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:33,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:58:33,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088499867] [2021-08-31 04:58:33,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088499867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:58:33,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:58:33,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:58:33,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099448716] [2021-08-31 04:58:34,713 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:58:34,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:58:34,713 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:58:34,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:58:34,714 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:58:34,714 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:34,714 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:58:34,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:58:34,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2021-08-31 04:58:34,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:58:34,714 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:58:34,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:34,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,103 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:58:38,104 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:58:38,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:38,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:38,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:38,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 04:58:38,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:58:38,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:58:38,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 04:58:38,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:38,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:38,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 04:58:38,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:58:38,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:58:38,303 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:58:38,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:38,308 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:58:38,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:58:38,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:58:38,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:58:38,308 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:58:38,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:38,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:58:38,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:58:38,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2021-08-31 04:58:38,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:58:38,308 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:58:38,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:58:41,455 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:58:41,458 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:58:41,459 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 04:58:41,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,508 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 04:58:41,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:41,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:41,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,555 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 04:58:41,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 04:58:41,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,596 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-31 04:58:41,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,603 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-31 04:58:41,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 04:58:41,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 04:58:41,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:41,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:41,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-31 04:58:41,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,757 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,758 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 04:58:41,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:41,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:41,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 04:58:41,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:41,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:41,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,864 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,865 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:41,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 04:58:41,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,922 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,923 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 04:58:41,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 [2021-08-31 04:58:41,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:41,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:41,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:41,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:41,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:41,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:41,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:41,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:41,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:41,986 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:41,989 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:42,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 [2021-08-31 04:58:42,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:42,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:42,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 04:58:42,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:42,054 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,055 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:42,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 [2021-08-31 04:58:42,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:42,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:42,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:42,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 04:58:42,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:42,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,109 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:42,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:42,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:42,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:42,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:42,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 04:58:42,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,168 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 [2021-08-31 04:58:42,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,170 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) [2021-08-31 04:58:42,177 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 [2021-08-31 04:58:42,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:42,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 04:58:42,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 04:58:42,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,219 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 [2021-08-31 04:58:42,219 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,220 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) [2021-08-31 04:58:42,221 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 [2021-08-31 04:58:42,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:42,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:42,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:42,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:42,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,259 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 [2021-08-31 04:58:42,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,260 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) [2021-08-31 04:58:42,261 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 [2021-08-31 04:58:42,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:42,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:42,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:42,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:42,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 04:58:42,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-31 04:58:42,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,288 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:42,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 04:58:42,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:58:42,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:58:42,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:58:42,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:58:42,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:58:42,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:58:42,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:58:42,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:58:42,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:58:42,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:58:42,305 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:58:42,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:58:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:58:42,330 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:58:42,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:58:42,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:58:42,334 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:58:42,334 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 27 Supporting invariants [] [2021-08-31 04:58:42,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 04:58:42,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:42,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:58:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:58:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:42,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:58:42,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:58:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:58:42,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:58:42,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:58:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:58:42,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 04:58:42,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:42,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-31 04:58:43,197 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 307 states and 446 transitions. Complement of second has 4 states. [2021-08-31 04:58:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 04:58:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2021-08-31 04:58:43,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2021-08-31 04:58:43,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:43,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2021-08-31 04:58:43,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:43,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2021-08-31 04:58:43,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:58:43,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. [2021-08-31 04:58:43,209 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:43,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2021-08-31 04:58:43,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:58:43,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:58:43,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:58:43,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:43,210 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:43,210 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:43,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:58:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:58:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:58:43,211 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:58:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:58:43,211 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-31 04:58:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-31 04:58:43,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:43,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:58:43,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:58:43,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:58:43,212 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:58:43,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 04:58:43,212 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:58:43,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 04:58:43,215 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:58:43,217 INFO L158 Benchmark]: Toolchain (without parser) took 13973.33ms. Allocated memory was 50.3MB in the beginning and 134.2MB in the end (delta: 83.9MB). Free memory was 26.6MB in the beginning and 88.7MB in the end (delta: -62.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,217 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.0MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:58:43,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.12ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 26.5MB in the beginning and 42.5MB in the end (delta: -16.0MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.09ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 39.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,219 INFO L158 Benchmark]: Boogie Preprocessor took 65.67ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 37.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,219 INFO L158 Benchmark]: RCFGBuilder took 530.33ms. Allocated memory is still 62.9MB. Free memory was 37.3MB in the beginning and 32.7MB in the end (delta: 4.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,219 INFO L158 Benchmark]: BuchiAutomizer took 12822.33ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 32.7MB in the beginning and 88.7MB in the end (delta: -56.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-08-31 04:58:43,221 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.32ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.0MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.12ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 26.5MB in the beginning and 42.5MB in the end (delta: -16.0MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.09ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 39.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.67ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 37.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.33ms. Allocated memory is still 62.9MB. Free memory was 37.3MB in the beginning and 32.7MB in the end (delta: 4.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 12822.33ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 32.7MB in the beginning and 88.7MB in the end (delta: -56.0MB). Peak memory consumption was 16.5MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 27 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:58:43,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...